The ring of polynomial over a von Neumann regular ring

Rigid Resolution of a Finitely Generated Module Over a Regular Local Ring

Reduced Gröbner Bases in Polynomial Rings over a Polynomial Ring

We define reduced Gröbner bases in polynomial rings over a polynomial ring and introduce an algorithm for computing them. There exist some algorithms for computing Gröbner bases in polynomial rings over a polynomial ring. However, we cannot obtain the reduced Gröbner bases by these algorithms. In this paper we propose a new notion of reduced Gröbner bases in polynomial rings over a polynomial r...

Stable Tameness of Two-Dimensional Polynomial Automorphisms Over a Regular Ring

In this paper it is established that all two-dimensional polynomial automorphisms over a regular ring R are stably tame. This results from the main theorem of this paper, which asserts that an automorphism in any dimension n is stably tame if said condition holds point-wise over SpecR. A key element in the proof is a theorem which yields the following corollary: Over an Artinian ring A all two-...

rigid resolution of a finitely generated module over a regular local ring

Von Neumann Regular Cellular Automata

For any group G and any set A, a cellular automaton (CA) is a transformation of the configuration space A G defined via a finite memory set and a local function. Let CA(G; A) be the monoid of all CA over A G. In this paper, we investigate a generalisation of the inverse of a CA from the semigroup-theoretic perspective. An element τ ∈ CA(G; A) is von Neumann regular (or simply regular) if there ...