The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals

Teo Mora

Type: Book-Chapter

Publication Date: 2009-01-01

Citations: 12

DOI: https://doi.org/10.1007/978-3-540-93806-4_3

View Publication

Locations

Springer eBooks - View

Similar Works

Action	Title	Year	Authors
+	MXL 3 : An Efficient Algorithm for Computing Groebner Bases of Zero-Dimensional Ideals	2010	Mohamed Mohamed Saied Emam C Alexander Daniel Jíntai Ding Buchmann Johannes Bulygin Stanislav
+	Computing PUR of Zero-Dimensional Ideals of Breadth at Most One	2021	Jian Zhong Pan Baoxin Shang Zhe Li Shugong Zhang
+	Space efficient computation for low-dimensional ideals	2009	Ernst Mayr
+	Gröbner bases of zero-dimensional ideals	2002	Bernd Sturmfels
+	Special properties of Zero dimensional ideals: new algorithms	2018	Lorenzo Robbiano
+ PDF Chat	An FGLM-like algorithm for computing the radical of a zero-dimensional ideal	2017	Teo Mora
+	Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory	1985	Bruno Buchberger
+	An effective procedure for minimal bases of ideals in Z[x]	2003	Luis F. Cáceres-Duque
+ PDF Chat	The two-generator problem for ideals.	1970	Eben Matlis
+	Efficient generation of zero dimensional ideals in polynomial rings	1990	P. L. N. Varma
+	On lucky ideals for Gröbner basis computations	1992	Franz Pauer
+	Effective algorithm for computing Noetherian operators of zero-dimensional ideals	2022	Katsusuke Nabeshima Shinichi Tajima
+	Computing Generic Fibres of Polynomial Ideals with FGLM and Hensel Lifting	2024	Jérémy Berthomieu Rafael Mohr
+	MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals	2010	Mohamed Saied Emam Mohamed Daniel Cabarcas Jíntai Ding Johannes Buchmann Stanislav Bulygin
+	Greobner Bases : an algorithmic method in polynomial ideal theory	1985	Bruno Buchberger
+	Grobner theory of zero dimensional ideals with a view toward combinatorics	2007	Alint Felszeghy
+	Gröbner theory of zero dimensional ideals with a view toward combinatorics	2007	Bálint Felszeghy
+	Monomial-agnostic computation of vanishing ideals	2024	Hiroshi Kera Yoshihiko Hasegawa
+	Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting	2024	Jérémy Berthomieu Rafael Mohr
+	A Gröbner Basis Algorithm for Ideals over Zero-Dimensional Valuation Rings	2021	Dongmei Li Jinwang Liu

Works That Cite This (3)

Action	Title	Year	Authors
+	Degröbnerization: a political manifesto	2022	Michela Ceria Samuel Lundqvist Teo Mora
+	Separators for Polynomial Dynamic Systems with Linear Complexity	2019	Ines Abdeljaoued-Tej Alia Benkahla Ghassen Haddad Annick Valibouze
+ PDF Chat	A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension	2020	Simone Naldi Vincent Neiger

Works Cited by This (32)

Action	Title	Year	Authors
+	An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations	1988	Winfried Auzinger Hans J. Stetter
+	A Remark on a Remark by Macaulay or Enhancing Lazard Structural Theorem	2011	Maria Grazia Marinari Teo Mora
+	Solving systems of algebraic equations by using gröbner bases	1989	Michael Kalkbrener
+	A theorem on refining division orders by the reverse lexicographic order	1987	David Bayer Michael Stillman
+ PDF Chat	On multiplicities in polynomial system solving	1996	Maria Grazia Marinari Harald E. Möller Teo Mora
+	The lex game and some applications	2006	Bálint Felszeghy Balázs Ráth Lajos Rónyai
+	The vanishing ideal of a finite set of closed points in affine space	2007	Mathias Lederer
+	Hilbert Functions and the Buchberger Algorithm	1996	Carlo Enrico Traverso
+	Computing Ideals of Points	2000	John Abbott Anna Maria Bigatti Martin Kreuzer Lorenzo Robbiano
+	A new method for solving algebraic systems of positive dimension	1991	Daniel Lazard