Computing Free Non-commutative Groebner Bases over Z with Singular:Letterplace

TL;DR

This paper extends the computation of Groebner bases over rings like Z using the Singular system, providing detailed proofs, new examples, and applications, especially in non-commutative algebraic structures.

Contribution

It introduces algorithms for free non-commutative Groebner bases over Z, with detailed proofs, implementation in Singular, and explores differences from commutative cases.

Findings

Algorithms for Groebner bases over Z are implementable in Singular.

Significant differences in Groebner basis behavior between free and near-commutative algebras.

New applications to Iwahori-Hecke algebras and other algebraic structures.

Abstract

With this paper we present an extension of our recent ISSAC paper about computations of Groebner(-Shirshov) bases over free associative algebras Z<X>. We present all the needed proofs in details, add a part on the direct treatment of the ring Z/mZ as well as new examples and applications to e.g. Iwahori-Hecke algebras.The extension of Groebner bases concept from polynomial algebras over fields to polynomial rings over rings allows to tackle numerous applications, both of theoretical and of practical importance.Groebner and Groebner-Shirshov bases can be defined for various non-commutative and even non-associative algebraic structures. We study the case of associative rings and aim at free algebras over principal ideal rings. We concentrate ourselves on the case of commutative coefficient rings without zero divisors (i.e. a domain). Even working over Z allows one to do computations, which can be treated as universal for fields of arbitrary characteristic. By using the systematic approach, we revisit the theory and present the algorithms in the implementable form. We show drastic differences in the behavior of Groebner bases between free algebras and algebras, close to commutative.Even the process of the formation of critical pairs has to be reengineered, together with the implementing the criteria for their quick discarding.We present an implementation of algorithms in the Singular subsystem called Letterplace, which internally uses Letterplace techniques (and Letterplace Groebner bases), due to La Scala and Levandovskyy. Interesting examples and applications accompany our presentation.