✦ LIBER ✦

Gröbner bases and invariant theory

✍ Scribed by Bernd Sturmfels; Neil White

Book ID: 107710022
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 892 KB
Volume: 76
Category: Article
ISSN: 0001-8708
DOI: 10.1016/0001-8708(89)90053-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gröbner Bases, Invariant Theory and Equi

Gröbner Bases, Invariant Theory and Equivariant Dynamics

✍ Karin Gatermann; Frédéric Guyard 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 698 KB

This paper is about algorithmic invariant theory as it is required within equivariant dynamical systems. The question of generic bifurcation equations (arbitrary equivariant polynomial vector) requires the knowledge of fundamental invariants and equivariants. We discuss computations which are relate

Gröbner Bases and Systems Theory

✍ Bruno Buchberger 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 169 KB

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

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

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