✦ LIBER ✦

Gröbner Bases for Complete Uniform Families

✍ Scribed by Gábor Hegedűs; Lajos Rónyai

Book ID: 110429086
Publisher: Springer
Year: 2003
Tongue: English
Weight: 90 KB
Volume: 17
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1022934815185

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiplicative Bases, Gröbner Bases, and

Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases

✍ Edward L. Green 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 314 KB

In this paper, we study conditions on algebras with multiplicative bases so that there is a Gröbner basis theory. We introduce right Gröbner bases for a class of modules. We give an elimination theory and intersection theory for right submodules of projective modules in path algebras. Solutions to h

Gröbner bases

✍ Arnab Chakraborty 📂 Article 📅 2000 🏛 Indian Academy of Sciences 🌐 English ⚖ 920 KB

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

Regular Gröbner Bases

✍ Jonas MÅnsson; Patrik Nordbeck 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In this paper we introduce the concept of bi-automaton algebras, generalizing the automaton algebras previously defined by Ufnarovski. A bi-automaton algebra is a quotient of the free algebra, defined by a binomial ideal admitting a Gröbner basis which can be encoded as a regular set; we call such a

Canonical comprehensive Gröbner bases

✍ Volker Weispfenning 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Comprehensive Gröbner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992. Since then the construction has been implemented in the computer algebra systems ALDES/SAC-2, MAS, REDUCE and MAPLE. A comprehensive Gröbner basis is a finite subset G of a p

Counting and Gröbner Bases

✍ K. Kalorkoti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 239 KB

We show how the complexity of counting relates to the well known phenomenon that computing Gröbner bases under a lexicographic order is generally harder than total degree orders. We give simple examples of polynomials for which it is very easy to compute their Gröbner basis using a total degree orde