Minimal Gröbner bases and the predictable leading monomial property
نویسندگان
چکیده
منابع مشابه
Minimal Gröbner bases and the predictable leading monomial property
We focus on Gröbner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the " predictable leading monomial (PLM) property " that is shared by minimal Gröbner bases of modules in F[x] q , no matter what positional term order is used. The PLM property is useful in a range of applications and can be seen as a strengthening of the wellknown predictable deg...
متن کاملar X iv : 0 90 6 . 46 02 v 1 [ cs . I T ] 2 5 Ju n 20 09 Minimal Gröbner bases and the predictable leading monomial property
In this paper we focus on Gröbner bases over rings for the univariate case. We identify a useful property of minimal Gröbner bases, that we call the " predictable leading monomial (PLM) property ". The property is stronger than " row reducedness " and is crucial in a range of applications. The first part of the paper is tutorial in outlining how the PLM property enables straightforward solution...
متن کاملA Monomial-Oriented GVW for Computing Gröbner Bases
The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gröbner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for short. The moGVW algorithm presents a new frame of GVW and regards labeled monomials instead of labeled polynomials as basic elements of the algorithm. Being di...
متن کاملMultiplicative Bases, Gröbner Bases, and Right Gröbner Bases
Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...
متن کاملMonomial Orderings, Rewriting Systems, and Gröbner Bases for the Commutator Ideal of a Free Algebra
In this paper we consider a free associative algebra on three generators over an arbitrary field K. Given a term ordering on the commutative polynomial ring on three variables over K, we construct uncountably many liftings of this term ordering to a monomial ordering on the free associative algebra. These monomial orderings are total well orderings on the set of monomials, resulting in a set of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.08.030