# Regular Gröbner Bases

@article{Mnsson2002RegularGB, title={Regular Gr{\"o}bner Bases}, author={Jonas M{\aa}nsson and Patrik Nordbeck}, journal={J. Symb. Comput.}, year={2002}, volume={33}, pages={163-181} }

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 Grobner basis which can be encoded as a regular set; we call such a Grobner basis regular. We give several examples of bi-automaton algebras, and show how automata connected to regular Grobner bases can be used to perform reduction.

## 8 Citations

### Automaton algebras and intermediate growth

- Mathematics
- 2017

We present an example of a quadratic algebra given by three generators and three relations, which is automaton (the set of normal words forms a regular language) and such that its ideal of relations…

### Quadratic automaton algebras and intermediate growth

- Mathematics
- 2017

We present an example of a quadratic algebra given by three generators and three relations, which is automaton (the set of normal words forms a regular language) and such that its ideal of relations…

### Recognition of certain properties of automaton algebras

- Mathematics
- 2008

Abstract. The paper considers a new algebraic object, the completely automaton binomial algebras, which generalize certain existing classes of algebras. The author presents a classification of…

### On the semiprimitivity of finitely generated algebras

- Mathematics
- 2014

Finitely generated associative algebras A = K〈a1, . . . , an〉 over a field K defined by homogeneous relations are considered. If there exists an order on the associated free monoid FMn of rank n such…

### Canonical Bases for Algebraic Computations

- Mathematics
- 2001

This thesis deals with computational methods in algebra, mainly focusing on the concept of Grobner and SAGBI bases in non-commutative algebras. The material has a natural division into two parts. The…

### Gröbner bases for quadratic algebras of skew type

- MathematicsProceedings of the Edinburgh Mathematical Society
- 2012

Abstract Non-degenerate monoids of skew type are considered. This is a class of monoids S defined by n generators and $\binom{n}{2}$ quadratic relations of certain type, which includes the class of…

### On a Class of Automaton Algebras

- MathematicsProceedings of the Edinburgh Mathematical Society
- 2016

Abstract We show that every finitely generated algebra that is a finitely generated module over a finitely generated commutative subalgebra is an automaton algebra in the sense of Ufnarovskii.

### Solving Polynomial Equation Systems I

- Mathematics
- 2003

Preface Part I. The Kronecker-Duval Philosophy: 1. Euclid 2. Intermezzo: Chinese remainder theorems 3. Cardano 4. Intermezzo: multiplicity of roots 5. Kronecker I: Kronecker's philosophy 6.…

## References

SHOWING 1-10 OF 41 REFERENCES

### On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases

- Mathematics, Computer ScienceComput. Sci. J. Moldova
- 2000

Algorithm to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains and can be used to compute the Hilbert series and Poincare series for any algebra with a rational set of leading words of its minimal Grobner basis.

### On some basic applications of Gröbner bases in non-commutative polynomial rings

- Mathematics
- 1998

In this paper we generalize some basic applications of Grobner bases
in commutative polynomial rings to the non-commutative case. We define
a non-commutative elimination order. Methods
of finding the…

### An Introduction to Commutative and Noncommutative Gröbner Bases

- MathematicsTheor. Comput. Sci.
- 1994

### On the homology of associative algebras

- Mathematics
- 1986

We present a new free resolution for k as an G-module, where G is an associative augmented algebra over a field k. The resolution reflects the combinatorial properties of G. Introduction. Let k be a…

### Gröbner bases and convex polytopes

- Mathematics
- 1995

Grobner basics The state polytope Variation of term orders Toric ideals Enumeration, sampling and integer programming Primitive partition identities Universal Grobner bases Regular triangulations The…

### Canonical subalgebraic bases in non-commutative polynomial rings

- MathematicsISSAC '98
- 1998

Canonical bases, also called SAGBI bases, for subalgebras of the non-commutative polynomial ring are investigated and methods are developed for the test whether bases are canonical, and for the completion procedure of constructing canonical bases.

### A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra

- MathematicsComputers and Mathematics
- 1989

A completion procedure for computing a canonical basis for a k-subalgebra that shares many properties of a Grobner basis and may not terminate for some orderings thus giving an infinite canonical basis.

### The Use of Knuth-Bendix Methods to Solve the Word Problem in Automatic Groups

- MathematicsJ. Symb. Comput.
- 1991

### Some Undecidability Results Concerning the Property of Preserving Regularity

- Computer ScienceTheor. Comput. Sci.
- 1998