Recognizing trace graphs of closed braids

MaRDI QIDQ624256zbMATH OpenFDO

Authors Thomas Fiedler, Vitaliy Kurlin

Publication date 9 February 2011

Published in Osaka Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0808.2713, https://projecteuclid.org/euclid.ojm/1292854309

zbMATH Keywords

conjugacy problembraidsclosed braidstetrahedral movestrace graphstrihedral moves

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to algebraic topology (55-04) Braid groups; Artin groups (20F36)

Abstract: To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a fixed number of strands, we recognize trace graphs up to isotopy and trihedral moves in polynomial time with respect to the braid length.

Recommendations

• A 1-parameter approach to links in a solid torus
• Trace diagrams and biquandle brackets
• Algorithmic recognition of quasipositive 4-braids of algebraic length three.
• Recognition algorithms in knot theory
• Representation of links by braids: A new algorithm

Cites work

• scientific article; zbMATH DE number 1113397 (Why is no real title available?)
• scientific article; zbMATH DE number 1840602 (Why is no real title available?)
• A 1-parameter approach to links in a solid torus
• A Singular Integral Equation Containing a Parameter
• Braids, Links, and Mapping Class Groups. (AM-82)
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• Conjugacy in Garside groups. III: Periodic braids.
• FIBER QUADRISECANTS IN KNOT ISOTOPIES
• Markov Moves Cannot be Replaced by Double Markov Moves
• On closed 3-braids
• THE BRAID GROUP AND OTHER GROUPS
• The \(n\)th root of a braid is unique up to conjugacy.

Cited in

(2)

• The conjugacy problem for groups of alternating prime tame links is polynomial-time
• A 1-parameter approach to links in a solid torus

This page was built for publication: Recognizing trace graphs of closed braids

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