𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gröbner Bases, Invariant Theory and Equivariant Dynamics

✍ Scribed by Karin Gatermann; Frédéric Guyard

Book ID
102976566
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
698 KB
Volume
28
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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 related to this for finite groups and semi-simple Lie groups. We consider questions such as the completeness of invariants and equivariants. Efficient computations are gained by the Hilbert series driven Buchberger algorithm because computation of elimination ideals is heavily required. Applications such as orbit space reduction are presented.

📜 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

Counting and Gröbner Bases
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