✦ LIBER ✦

Gröbner Bases in Perturbative Calculations

✍ Scribed by Vladimir P. Gerdt

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 143 KB
Volume: 135
Category: Article
ISSN: 0920-5632
DOI: 10.1016/j.nuclphysbps.2004.09.011

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

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

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

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

Reduced Gröbner Bases Under Composition

✍ J. Gutierrez; R.R. San Miguel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 463 KB

In this paper we contribute with one main result to the interesting problem initiated by Hong (1998, J. Symb. Comput. 25, 643-663) on the behaviour of Gröbner bases under composition of polynomials. Polynomial composition is the operation of replacing the variables of a polynomial with other polynom

Gröbner Bases in Clifford and Grassmann

Gröbner Bases in Clifford and Grassmann algebras

✍ David Hartley; Philip Tuckey 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We give an account of the theory of Gröbner bases for Clifford and Grassmann algebras, both important in physical applications. We describe a characterization criterion tailored to these algebras which is significantly simpler than those given earlier or for more general non-commuting algebras. Our