Fast algorithms for identification and comparison of braids.

DOI10.1023/B:JOTH.0000008747.72654.14MaRDI QIDQ1781292zbMATH OpenOpenAlexFDO

Authors Niranjan Chakravarthy

Publication date 23 June 2005

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:joth.0000008747.72654.14

zbMATH Keywords

comparison algorithmsDehornoy orders on braid groupsfast algorithmsfinite ordersmapping class groupsnormal forms

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Braid groups; Artin groups (20F36) Fundamental group, presentations, free differential calculus (57M05) Comparison of PL-structures: classification, Hauptvermutung (57Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• A fast method for comparing braids
• A new algorithm for solving the word problem in braid groups
• About the effective classification of conjugacy classes of braids
• ALGORITHMS FOR POSITIVE BRAIDS
• Computation of the ordinal of braids

Cited in

(7)

• A general approach to fast prototype the topology of braided structures
• The braided Ptolemy-Thompson group is finitely presented.
• Twist number of (closed) braids
• Dehornoy’s ordering on the braid group and braid moves
• A fast method for comparing braids
• Prime factorization of meanders
• Homotopy-aware multi-agent path planning on plane

This page was built for publication: Fast algorithms for identification and comparison of braids.

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