Normal forms of random braids.

DOI10.1016/j.jalgebra.2013.10.008zbMath1337.20039arXiv1302.6676OpenAlexW2963251373MaRDI QIDQ402699

Volker Gebhardt, Stephen Tawn

Publication date: 28 August 2014

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsgrowth ratesexpected valueregular languagesGarside groupsnormal form theoremsGarside monoidspenetration distancerandom braids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

On the penetration distance in Garside monoids ⋮ Asymptotic combinatorics of Artin-Tits monoids and of some other monoids ⋮ Uniform measures on braid monoids and dual braid monoids

Uses Software

• Magma

Cites Work

• Growth rates of complexity of power-free languages
• Geodesic automation and growth functions for Artin groups of finite type
• The Magma algebra system. I: The user language
• An algebraic method for public-key cryptography
• Generating random braids
• On the genericity of pseudo-Anosov braids. I: Rigid braids.
• Artin-Gruppen und Coxeter-Gruppen
• Theory of braids
• Groupes de Garside
• The dual braid monoid
• Combinatorial Complexity of Regular Languages
• Automatic Structures for Torus Link Groups
• THE BRAID GROUP AND OTHER GROUPS
• Unnamed Item
• Unnamed Item

This page was built for publication: Normal forms of random braids.