Representation of links by braids: A new algorithm
From MaRDI portal
Alexander's classical result shows that any oriented link can be presented as a closed braid. There have been a number of recent proofs of this result aimed at controlling the `complexity' of the braid in terms of the initial diagram of the link. The author presents a very simple and economical algorithm, which does not increase the number of Seifert circles, and which heavily limits the increase in the number of crossings. The elegant combinatorial proof is based on an analysis of the dual graph constructed from the dissection of the plane by the Seifert circles.
Recommendations
Cited in
(69)- Braiding a link with a fixed closed braid
- A formula for the braid index of links
- The minimal number of Seifert circles equals the braid index of a link
- A new algorithm for recognizing the unknot
- A combinatorial representation of links by quasitoric braids
- Genera of some closed 4-braids
- Markov's theorem in 3-manifolds
- Intermediate links of plane curves
- A general approach to fast prototype the topology of braided structures
- The number of Reidemeister moves for splitting a link
- The parametrized complexity of knot polynomials
- Braidoids
- Augmentations and link group representations
- The Jones polynomial and graphs on surfaces
- Complexity classes as mathematical axioms. II
- On unknotting numbers and four-dimensional clasp numbers of links
- An algorithm to find braid representatives of links
- On the definition of graph index
- Seifert matrices of braids with applications to isotopy and signatures
- Reflection Groups
- On the crossing number of positive knots and braids and braid index criteria of Jones and Morton-Williams-Franks
- Knots and graphs: two centuries of interaction
- scientific article; zbMATH DE number 4135033 (Why is no real title available?)
- WHERE THE LINKS–GOULD INVARIANT FIRST FAILS TO DISTINGUISH NONMUTANT PRIME KNOTS
- Seifert surfaces in open books, and a new coding algorithm for links
- Bennequin’s inequality and the positivity of the signature
- Alternating sum formulae for the determinant and other link invariants
- scientific article; zbMATH DE number 5177411 (Why is no real title available?)
- An algorithm for constructing diagrams of two-bridge knots and links with period two
- VASSILIEV INVARIANTS ON FIBERED AND MUTUALLY OBVERSE KNOTS
- Braid representations of periodic links
- COMPUTER AIDED KNOT THEORY USING MATHEMATICA AND MATHLINK
- Seifert graphs and the braid index of classical and singular links
- Rational Knots and a Theorem of Kanenobu
- GAUSS SUM INVARIANTS, VASSILIEV INVARIANTS AND BRAIDING SEQUENCES
- Automatic Evaluation of the Links–Gould Invariant for all Prime Knots of up to 10 Crossings
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT
- scientific article; zbMATH DE number 802739 (Why is no real title available?)
- On alternating closed braids
- Exchangeability and Non-Conjugacy of Braid Representatives
- On homogeneous quasipositive links
- An Alexander-type invariant for doodles
- Alexander and Markov theorems for generalized knots. I
- Alexander and Markov theorems for generalized knots, II generalized braids
- scientific article; zbMATH DE number 7255552 (Why is no real title available?)
- Positive knots, closed braids and the Jones polynomial
- Algorithms for concatenating templates
- A reduced set of moves on one-vertex ribbon graphs coming from links
- Arc-presentations of links: Monotonic simplification
- Book Review: Braid groups (With the graphical assistance of Olivier Dodane); Ordering braids
- Braids for unoriented Pretzel links
- A polynomial quantum algorithm for approximating the Jones polynomial
- On McMullen's and other inequalities for the Thurston norm of link complements
- Description chirurgicale des revêtements triples simples de \(S^3\) ramifiés le long d'un entrelacs. (Surgery description of simple three fold coverings of the 3-sphere branched along a link)
- Braided open book decompositions in \(S^{3}\)
- Minimal generating sets of Reidemeister moves
- Subsymmetric exchanged braids and the Burau matrix
- Recognizing trace graphs of closed braids
- Braid presentation of spatial graphs
- Twisted braids
- Minimal generating sets and the abelianization for the quasitoric braid group
- A short presentation of the original Jones polynomial
- Realizing strongly quasipositive links and Bennequin surfaces
- Positive braids and concordance
- Braid alternation number of ten-crossing prime knots
- Studying links via closed braids. I: A finiteness theorem
- The number of Vogel operations to deform a link diagram to a closed braid
- Genus generators and the positivity of the signature
- Ropelengths of closed braids
This page was built for publication: Representation of links by braids: A new algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916146)
