An algorithmic approach to Hurwitz equivalences.

MaRDI QIDQ2446423zbMATH OpenFDO

Authors Tetsuya Ito

Publication date 16 April 2014

Published in Hiroshima Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.hmj/1389102579

zbMATH Keywords

algorithmscomplete presentationsHurwitz equivalence problemHurwitz equivalencesHurwitz search problemword problem in monoidsword reversing

Mathematics Subject Classification ID

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

Recommendations

• Graph theoretic method for determining Hurwitz equivalence in the symmetric group.
• scientific article; zbMATH DE number 2135190
• A new algorithm for solving the word problem in braid groups
• A Whitehead algorithm for surface groups
• Hurwitz Equivalence in the Braid Group B₃

Cites work

• Artin monoids inject in their groups
• Complete positive group presentations.
• Finite orbits of Hurwitz actions on braid systems.
• scientific article; zbMATH DE number 4179648 (Why is no real title available?)
• scientific article; zbMATH DE number 4103236 (Why is no real title available?)
• scientific article; zbMATH DE number 1303895 (Why is no real title available?)
• scientific article; zbMATH DE number 1774899 (Why is no real title available?)
• The subword reversing method.

Cited in

(2)

• Graph theoretic method for determining Hurwitz equivalence in the symmetric group.
• scientific article; zbMATH DE number 6415740 (Why is no real title available?)

This page was built for publication: An algorithmic approach to Hurwitz equivalences.

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