Syntactical methods for braids of three strands

DOI10.1006/jsco.2000.0473zbMath0990.20022OpenAlexW2021098632MaRDI QIDQ5938545

Serge Burckel

Publication date: 22 July 2001

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

Full work available at URL: https://doi.org/10.1006/jsco.2000.0473

zbMATH Keywords

word problemgrowth functionspositive braid monoidsrewriting systemssyntactical linear time algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Grammars and rewriting systems (68Q42)

Related Items

A result on braids via the investigation of a rewriting system. ⋮ Noncommutative Gröbner Bases: Applications and Generalizations ⋮ Unnamed Item ⋮ GROWTH SERIES FOR ARTIN GROUPS OF DIHEDRAL TYPE

Cites Work

• Unnamed Item
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Growth of the positive braid semigroups
• The wellordering on positive braids
• Computation of the ordinal of braids
• Braid group actions on left distributive structures, and well orderings in the braid groups
• Church-Rooser property and homology of monoids
• Braids, Links, and Mapping Class Groups. (AM-82)
• Braid Groups and Left Distributive Operations
• THE BRAID GROUP AND OTHER GROUPS