𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gröbner Bases for Products of Determinantal Ideals

✍ Scribed by H. Arjunwadkar

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
85 KB
Volume
171
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

SAGBI and SAGBI-Gröbner Bases over Princ
SAGBI and SAGBI-Gröbner Bases over Principal Ideal Domains
✍ W.W. ADAMS; S. HOŞTEN; P. LOUSTAUNAU; J.L. MILLER 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Our aim in this paper is to improve on the algorithms for the computation of SAGBI and SAGBI-Gröbner for subalgebras of polynomial rings in the special case where the base ring is a principal ideal domain. In addition we will show the existence in general of strong SAGBI bases (the natural analogue

Gröbner Bases for Spaces of Quadrics of
Gröbner Bases for Spaces of Quadrics of Low Codimension
✍ Aldo Conca 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Let R = ⊕ i≥0 R i be a quadratic standard graded K-algebra. Backelin has shown that R is Koszul provided dim R 2 ≤ 2. One may wonder whether, under the same assumption, R is defined by a Gröbner basis of quadrics. In other words, one may ask whether an ideal I in a polynomial ring S generated by a s

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

A New Algorithm for Discussing Gröbner B
A New Algorithm for Discussing Gröbner Bases with Parameters
✍ Antonio Montes 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Let F be a set of polynomials in the variables x = x 1 , . . . , xn with coefficients in R[a], where R is a UFD and a = a 1 , . . . , am a set of parameters. In this paper we present a new algorithm for discussing Gröbner bases with parameters. The algorithm obtains all the cases over the parameters

Gröbner Bases in Orders of Algebraic Num
Gröbner Bases in Orders of Algebraic Number Fields
✍ David Andrew Smith 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Gröbner basis g