𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gröbner Bases of Modules over Reduction Rings

✍ Scribed by S. Stifter

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
374 KB
Volume
159
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

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 other approaches to compute Gröbner bases of modules, in the sense that it applies to many more rings, not just polynomial rings over fields. C 1993 Academic Press, Inc.

📜 SIMILAR VOLUMES

Gröbner Bases over Galois Rings with an
Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes
✍ Eimear Byrne; Patrick Fitzpatrick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 346 KB

We develop a theory of Gröbner bases over Galois rings, following the usual formulation for Gröbner bases over finite fields. Our treatment includes a division algorithm, a characterization of Gröbner bases, and an extension of Buchberger's algorithm. One application is towards the problem of decodi

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

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–Shirshov Bases for Irreducible s
Gröbner–Shirshov Bases for Irreducible sln + 1-Modules
✍ Seok-Jin Kang; Kyu-Hwan Lee 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 169 KB

We determine the Gröbner-Shirshov bases for finite-dimensional irreducible representations of the special linear Lie algebra sl n+1 and construct explicit monomial bases for these representations. We also show that each of these monomial bases is in 1-1 correspondence with the set of semistandard Yo

Reduced Gröbner Bases, Free Difference–D
Reduced Gröbner Bases, Free Difference–Differential Modules and Difference–Differential Dimension Polynomials
✍ Alexander Levin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 442 KB

We define a special type of reduction in a free left module over a ring of differencedifferential operators and use the idea of the Gröbner basis method to develop a technique that allows us to determine the Hilbert function of a finitely generated differencedifferential module equipped with the nat