• Publications
  • Influence
Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering
We present an efficient algorithm for the transformation of a Grobner basis of a zero-dimensional ideal with respect to any given ordering into a GroBner basis withrespect to any other ordering. Expand
  • 624
  • 28
The Gröbner Fan of an Ideal
To every ideal I in the polynomial ring A:=k[X"1,..., X"n] new invariants are attached, such as the Grobner Fan F(I), G(I) and ATO( I) of the almost term-orderings of I. Expand
  • 203
  • 18
An Introduction to Commutative and Noncommutative Gröbner Bases
  • T. Mora
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 7 November 1994
Grobner bases are a finite model of an infinite linear Gauss-reduced basis of an ideal viewed as a vector space and Buchberger algorithm is the corresponding generalization of the Gaussian elimination algorithm for their computation. Expand
  • 259
  • 16
Gröbner bases of ideals defined by functionals with an application to ideals of projective points
In this paper we study 0-dimensional polynomial ideals defined by a dual basis, i.e. as the set of polynomials which are in the kernel of a set of linear morphisms from the Polynomial ring to the base field. Expand
  • 121
  • 12
Gröbner bases computation using syzygies
Bases Computation Mollert Teo Mora$ Using Syzygies*
  • 84
  • 9
The shape of the Shape Lemma
The Shape Lemma was originally introduced in [3] and so christened by Lakshman ([5]). Expand
  • 83
  • 9
Gröbner duality and multiplicities in polynomial system solving
This paper deals with the description of the solutions of zero dimensional systems of polynomial equations. Expand
  • 34
  • 5
“One sugar cube, please” or selection strategies in the Buchberger algorithm
In this paper redescribe some experimentti findings on selection strategies for Gr6bner basis computation with the Buchberger algorithm. Expand
  • 177
  • 4
This paper deals with the description of the solutions of zero dimensional systems of polynomial equations. Based on different models for describing solutions, we consider suitable representations ofExpand
  • 70
  • 4
  • PDF
Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases
  • 114
  • 3