Syntactical methods for braids of three strands
From MaRDI portal
The author investigates the three-strand positive braid monoid. He proposes a syntactical linear time algorithm for the word problem, a nearly canonical rewriting system and the computation of the growth function.
Recommendations
- Three-dimensional braids and their descriptions
- Three-Dimensional Realizations of Braids
- On dilatation factors of braids on three strands.
- Systems of 3-braid equations
- A new distinguished form for 3-braids
- Braids via term rewriting
- Efficient algorithm for recognizing the Nielsen-Thurston type of a three-strand braid.
- A combing algorithm for orientable braided 3-belts
- Third-order braid invariants
- scientific article; zbMATH DE number 3966413
Cites work
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- Braid group actions on left distributive structures, and well orderings in the braid groups
- Braid Groups and Left Distributive Operations
- Braids, Links, and Mapping Class Groups. (AM-82)
- Church-Rooser property and homology of monoids
- Computation of the ordinal of braids
- Growth of the positive braid semigroups
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- THE BRAID GROUP AND OTHER GROUPS
- The wellordering on positive braids
Cited in
(6)- Rewrite systems for the positive braid semigroups
- A result on braids via the investigation of a rewriting system.
- Randomly growing braid on three strands and the Manta Ray
- Noncommutative Gröbner bases: applications and generalizations
- GROWTH SERIES FOR ARTIN GROUPS OF DIHEDRAL TYPE
- scientific article; zbMATH DE number 7204438 (Why is no real title available?)
This page was built for publication: Syntactical methods for braids of three strands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938545)