On the lexicographic degree of two-bridge knots - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Journal of Knot Theory and Its Ramifications Année : 2016

On the lexicographic degree of two-bridge knots

Résumé

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.
Fichier principal
Vignette du fichier
Lex2.pdf (349.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01084472 , version 1 (19-11-2014)
hal-01084472 , version 2 (23-11-2014)

Identifiants

Citer

Erwan Brugallé, Pierre-Vincent Koseleff, Daniel Pecker. On the lexicographic degree of two-bridge knots. Journal of Knot Theory and Its Ramifications, 2016, 25 (7), ⟨10.1142/S0218216516500449⟩. ⟨hal-01084472v2⟩
589 Consultations
146 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More