The word problem for polycyclic groups and nilpotent associative algebras
From MaRDI portal
Publication:6404577
arXiv2207.04704MaRDI QIDQ6404577FDOQ6404577
Authors: Tobias Moede, Matthias Neumann-Brosig 
Publication date: 11 July 2022
Abstract: The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an important class of group presentations with solvable word problem. These presentations play a fundamental role in the algorithmic theory of polycyclic groups. Problems analogous to the word problem arise when computing with other algebraic structures. Various aspects of this topic are considered in the literature. The aim of this paper is to provide a general approach to the topic including polycyclic groups and nilpotent associative algebras as examples.
Special aspects of infinite or finite groups (20Fxx) Associative rings and algebras with additional structure (16Wxx) Computational methods for problems pertaining to group theory (20-08) Computational aspects of associative rings (16Zxx)
This page was built for publication: The word problem for polycyclic groups and nilpotent associative algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404577)
