On the lexicographic degree of two-bridge knots
From MaRDI portal
Publication:3178575
Abstract: We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp lower bound for the lexicographic degree of any knot, using real polynomial curves properties.
Recommendations
- ON 2-ADJACENCY RELATION OF TWO-BRIDGE KNOTS AND LINKS
- On minimality of two-bridge knots
- On strongly n-trivial 2-bridge knots
- 2-bridge numbers of torus knots
- On the bridge number of knot diagrams with minimal crossings
- On two-bridge knots and a conjecture of Hirasawa-Murasugi
- A note on Riley polynomials of 2-bridge knots
- On Alexander-Conway polynomials of two-bridge links
- On the 2-bridge knots of Dunwoody \((1,1)\)-knots
Cites work
- scientific article; zbMATH DE number 2120368 (Why is no real title available?)
- Flexible, algebraically unrealizable curves: rehabilitation of Hilbert-Rohn-Gudkov approach
- Minimal Degree Sequence for Torus Knots
- ON POLYNOMIAL TORUS KNOTS
- POLYNOMIAL REPRESENTATION OF TORUS KNOTS
- Untangling trigonal diagrams
Cited in
(6)- The palette numbers of 2-bridge knots
- The determination of the pairs of two-bridge knots or links with Gordian distance one
- Untangling trigonal diagrams
- An algorithm for constructing diagrams of two-bridge knots and links with period two
- Computing Chebyshev knot diagrams
- The lexicographic degree of the first two-bridge knots
This page was built for publication: On the lexicographic degree of two-bridge knots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178575)