𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gröbner bases of powers of ideals of maximal minors

✍ Scribed by Aldo Conca

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
553 KB
Volume
121
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

✦ Synopsis

We determine Grijbner bases of powers of ideals of maximal minors of generic matrices. Then we derive a formula for the Hilbert series of the rings defined by these ideals. @

📜 SIMILAR VOLUMES

On the Complexity of Gröbner Bases Conve
On the Complexity of Gröbner Bases Conversion
✍ Michael Kalkbrener 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paper, the complexity of the conversion problem for Gröbner bases is investigated. It is shown that for adjacent Gröbner bases F and G, the maximal degree of the polynomials in G, denoted by deg(G), is bounded by a quadratic polynomial in deg(F ). For non-adjacent Gröbner bases, however, the

Gröbner Bases of Modules over Reduction
Gröbner Bases of Modules over Reduction Rings
✍ S. Stifter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Reduction rings are rings in which the Gröbner bases approach is possible, i.e., the Gröbner basis of an ideal in a reduction ring can be computed using Buchberger's algorithm. We show that one can also compute Gröbner bases of modules over reduction rings. Our approach is much more general than oth

Degrevlex Gröbner bases of generic compl
Degrevlex Gröbner bases of generic complete intersections
✍ Guillermo Moreno-Socı́as 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 246 KB

In this paper, we study the Hilbert-Samuel function of a generic standard graded K-algebra K[X1; : : : ; Xn]=(g1; : : : ; gm) when reÿned by an (')-adic ÿltration, ' being a linear form. From this we obtain a structure theorem which describes the stairs of a generic complete intersection for the deg

A new notion of reduction: Generating un
A new notion of reduction: Generating universal Gröbner bases of ideals in K[x, y]
✍ W. Herfort; H. Penz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 996 KB

In this paper a new notion of reduction depending on an arbitrary non-empty set ORD of term orderings on a polynomial ring is introduced. A general Buchberger algorithm based on this notion is devised. For a single element set ORD it specializes to the ordinary Buehberger algorithm. For ORD being th