Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type

DOI10.1016/j.jpaa.2018.02.021zbMath1454.20105arXiv1701.06413OpenAlexW2582313887WikidataQ130096384 ScholiaQ130096384MaRDI QIDQ1651499

Sarah Rees, Derek F. Holt, Patrick Dehornoy

Publication date: 12 July 2018

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

Full work available at URL: https://arxiv.org/abs/1701.06413

Mathematics Subject Classification ID

Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groupoids, semigroupoids, semigroups, groups (viewed as categories) (18B40)

Related Items (3)

Some computational aspects in the work of Patrick Dehornoy ⋮ Garside groups and geometry: Some thoughts for Patrick Dehornoy ⋮ Automaticity for graphs of groups

Cites Work

• Unnamed Item
• Rewriting systems in sufficiently large Artin-Tits groups.
• Multifraction reduction. I: The 3-Ore case and Artin-Tits groups of type FC.
• Multifraction reduction. III: The case of interval monoids
• A conjecture about Artin-Tits groups.
• Multifraction reduction. II: Conjectures for Artin-Tits groups
• Shortlex automaticity and geodesic regularity in Artin groups
• Artin groups of large type are shortlex automatic with regular geodesics
• THE SUBWORD REVERSING METHOD
• GROWTH SERIES FOR ARTIN GROUPS OF DIHEDRAL TYPE
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups

This page was built for publication: Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type