Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0903.5044

On Groebner Basis in Monoid and Group Rings

Birgit Reinert
View original source ↗Read source document ↗Export metadata ↓

Abstract

Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part non-commutative and non-Noetherian algebras. Most of these approaches require an admissible ordering on terms. In this Ph.D.thesis, the concept of Groebner bases is generalized to finitely generated monoid and group rings. Reduction methods are applied to represent monoid and group elements and to describe the right-ideal congruence in the corresponding monoid and group rings, respectively. In general, monoids and especially groups do not offer admissible orderings anymore. Thus, the definition of an appropriate reduction relation is confronted with the following problems: On the one hand, it is difficult to guarantee termination. On the other hand, reduction steps are not compatible with multiplication anymore, so that the reduction relation does not necessarily generate a right-ideal congruence. In this thesis, several possibilities of defining reduction relations are presented and evaluated w.r.t. the described problems. The concept of saturation (i.e. the extension of a set of polynomials in such a way that the right-ideal congruence it generates can be captured by reduction) is applied to characterize Groebner bases relatively to the different reductions by s-polynomials. Using these concepts and special structural properties, it was possible to define special reduction relations for special classes of monoids (e.g., finite, commutative, or free) and for different classes of groups (e.g., finite, free, plain, context-free, or nilpotent) and to develop terminating algorithms for computing Groebner bases w.r.t. these reduction relations.

Explore related subjects

math.RAmath.RT

Keep this discovery

BibTeXRIS

Birgit Reinert. 2009-03-29. On Groebner Basis in Monoid and Group Rings. https://arxiv.org/abs/0903.5044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗