A generalization of Gröbner basis algorithms to polycyclic group rings

DOI10.1006/JSCO.1997.0165zbMath0929.16024OpenAlexW2048373665MaRDI QIDQ1382039

Klaus Madlener, Birgit Reinert

Publication date: 15 February 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/248bfe95d6353f56f16a7e3be094c1189ed7ffa4

zbMATH Keywords

Gröbner basesdecision problemsmembership problemrewriting systemsintegral group ringspolycyclic group rings

Mathematics Subject Classification ID

Group rings (16S34) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic theory of languages and automata (68Q70) Computational aspects of associative rings (general theory) (16Z05)

Related Items (4)

Gröbner bases in function rings -- a guide for introducing reduction relations to algebraic structures ⋮ Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings ⋮ Computational ideal theory in finitely generated extension rings ⋮ Reduced Gröbner bases, free difference-differential modules and difference-differential dimension polynomials

This page was built for publication: A generalization of Gröbner basis algorithms to polycyclic group rings