A GATHERING PROCESS IN ARTIN BRAID GROUPS

DOI10.1142/S0218196706003190MaRDI QIDQ5493861zbMATH OpenOpenAlexFDO

Authors E. S. Esyp, Ilya 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 groupsnormal form theoremsrewriting systems

Mathematics Subject Classification ID

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

Abstract: In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two last sections of the paper we discuss the implementation of the introduced gathering process and the questions that arose in our work. This discussion leads us to some interesting observations, in particular, we offer a method of generating a random braid.

Recommendations

• Normal forms of random braids.
• A NORMAL FORM FOR BRAIDS
• Generating random braids
• A new algorithm for solving the word problem in braid groups
• Ordering the braid groups

Cites work

• Generic-case complexity, decision problems in group theory, and random walks.
• scientific article; zbMATH DE number 3297198 (Why is no real title available?)
• MULTIPLICATIVE MEASURES ON FREE GROUPS
• Statistical properties of locally free groups with applications to braid groups and growth of random heaps
• Theory of braids

Cited in

(1)

• Normal forms of random braids.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493861)