Antonio Montes
- J. Draisma. On the Casas-Alberó conjecture. (2006) www.linkpdf.com/.../on-the-casas-alveroconjecture-1-the-problem-eduardo-casas-alvero-.pdfGoogle Scholar
- M. Kalkbrenner, (1997). On the stability of Gröbner bases under specializations. Jour. Symb. Comp., 24:1, (1997), 51--58. Google ScholarDigital Library
- D. Kapur, Y. Sun, and D.K. Wang. A new algorithm for computing comprehensive Gröbner systems. Proceedings of ISSAC'2010, ACM Press, (2010) 29--36. Google ScholarDigital Library
- R. Losada, T. Recio, J.L. Valcarce, On the automatic discovery of Steiner-Lehmus generalizations. Proceedings of ADG 2010, (J. Richter-Gebert, P. Schreck, editors), München, (2010) 171--174.Google Scholar
- M. Manubens, A. Montes, Minimal Canonical Comprehensive Gröbner Systems, Jour. Symb. Comp., 44:5, (2009), 463--478. Google ScholarDigital Library
- A. Montes. New Algorithm for Discussing Gröbner Bases with Parameters. Jour. Symb. Comp. 33:1-2 (2002), 183--208. Google ScholarDigital Library
- A. Montes, T. Recio, (2007). Automatic discovery of geometry theorems using minimal canonical comprehensive Groebner systems. Proceedings of ADG 2006, L.N.A.I., Springer, 4869, (2007), 113--138. Google ScholarDigital Library
- http://www-ma2.upc.edu/?montes/ download a beta version of the software grobcov.lib. (2011).Google Scholar
- A. Montes, M. Wibmer. Gröbner Bases for Polynomial Systems with Parameters. Jour. Symb. Comp., 45, (2010), 1391--1425. Google ScholarDigital Library
- K. Nabeshima. A speed-up of the algorithm for computing comprehensive Gröbner systems. Proceedings of ISSAC'2007, ACM Press, (2007), 299--306. Google ScholarDigital Library
- http://www.mathematik.uni-bielefeld.de/?sillke/PUZZLES/steiner-lehmusGoogle Scholar
- A. Suzuki and Y. Sato. A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases. Proceedings of ISSAC'2006, ACM Press, (2006), 326--331. Google ScholarDigital Library
- D. Wang, Elimination practice: software tools and applications, Imperial College Press, London, (2004), p. 144--159. Google ScholarDigital Library
- V. Weispfenning. Comprehensive Gröbner bases. Jour. Symb. Comp. 14, (1992), 1--29. Google ScholarDigital Library
- V. Weispfenning. Canonical comprehensive Gröbner bases. Jour. Symb. Comp. 36, (2003), 669--683. Google ScholarDigital Library
- M. Wibmer, Gröbner bases for families of affine or projective schemes. Jour. Symb. Comp., 42:8 (2007), 803--834. Google ScholarDigital Library
Recommendations
Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system
AbstractA relationship between a parametric ideal and its generic Gröbner basis is discussed, and a new stability condition of a Gröbner basis is given. It is shown that the ideal quotient of the parametric ideal by the ideal generated using the generic ...
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computationIn Kapur et al (ISSAC, 2010), a new method for computing a comprehensive Grobner system of a parameterized polynomial system was proposed and its efficiency over other known methods was effectively demonstrated. Based on those insights, a new approach ...
Janet-like gröbner bases
CASC'05: Proceedings of the 8th international conference on Computer Algebra in Scientific ComputingWe define a new type of Gröbner bases called Janet-like, since their properties are similar to those for Janet bases. In particular, Janet-like bases also admit an explicit formula for the Hilbert function of polynomial ideals. Cardinality of a Janet-...
Comments