A GATHERING PROCESS IN ARTIN BRAID GROUPS

DOI10.1142/S0218196706003190zbMath1143.20021arXivmath/0605268OpenAlexW2092392819MaRDI QIDQ5493861

E. S. Esyp, Ilya V. Kazachkov

Publication date: 16 October 2006

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

braid groupsrewriting systemsnormal form theorems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Generic-case complexity, decision problems in group theory, and random walks.
• Statistical properties of locally free groups with applications to braid groups and growth of random heaps
• Theory of braids
• MULTIPLICATIVE MEASURES ON FREE GROUPS

This page was built for publication: A GATHERING PROCESS IN ARTIN BRAID GROUPS