Rewriting systems of Coxeter groups

DOI10.1016/0022-4049(94)90019-1MaRDI QIDQ1321036zbMATH OpenOpenAlexFDO

Authors Susan Hermiller

Publication date 15 January 1996

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-4049(94)90019-1

zbMATH Keywords

Coxeter groupsgeneratorsfundamental groupsword problemregular languagesfinite presentationsfinite complete rewriting systemsorientable closed surfaces

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• Rewriting systems and complete growth series for triangular Coxeter groups.
• Finite complete rewriting systems for groups
• scientific article; zbMATH DE number 2074997
• Rewriting systems and geometric three-manifolds
• Tame combings, almost convexity and rewriting systems for groups

Cites work

• scientific article; zbMATH DE number 4210420 (Why is no real title available?)
• scientific article; zbMATH DE number 3781925 (Why is no real title available?)
• scientific article; zbMATH DE number 43246 (Why is no real title available?)
• scientific article; zbMATH DE number 67429 (Why is no real title available?)
• scientific article; zbMATH DE number 195193 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• A finiteness property and an automatic structure for Coxeter groups
• A note on a special one-rule semi-Thue system
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Isoperimetric inequalities for soluble groups
• On the Homology of Associative Algebras
• On theories with a combinatorial definition of 'equivalence'
• Orderings for term-rewriting systems
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• Word problems and a homological finiteness condition for monoids

Cited in

(20)

• Algorithms and topology of Cayley graphs for groups.
• Effective topological complexity of orientable-surface groups
• Presentations of Coxeter groups of type \(A, B\), and \(D\) using prefix-reversal generators
• Infinite complete group presentations
• Rewriting systems in alternating knot groups with the Dehn presentation
• A catalogue of complete group presentations
• Rewriting systems and geometric three-manifolds
• Rewriting system of certain semigroups with three generators
• Deciding embeddability of partial groupoids into semigroups
• Finite complete rewriting systems for groups
• Automatic Groups Associated with Word Orders Other than Shortlex
• Subgroups of finite index in groups with finite complete rewriting systems
• scientific article; zbMATH DE number 2038382 (Why is no real title available?)
• scientific article; zbMATH DE number 2074997 (Why is no real title available?)
• Finding \(k\) shortest paths in Cayley graphs of finite groups
• REWRITING SYSTEMS IN ALTERNATING KNOT GROUPS
• Artin groups, rewriting systems and three-manifolds
• Rewriting systems and complete growth series for triangular Coxeter groups.
• The Tutte-Grothendieck group of an alphabetic rewriting system
• Rewriting systems for the surface classification theorem

Describes a project that uses

Uses Software

• RRL

This page was built for publication: Rewriting systems of Coxeter groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321036)