Crossing numbers of cable knots

Abstract We use the degree of the colored Jones knot polynomials to show that the crossing number of a ‐cable of an adequate knot with crossing number is larger than . As an application, we determine the crossing number of 2‐cables of adequate knots. We also determine the crossing number of the connected sum of any adequate knot with a 2‐cable of an adequate knot.

Authors

Institutions

Publication Details

Journal
Bulletin of the London Mathematical Society
Published
2024-08-26
DOI
https://doi.org/10.1112/blms.13140
Citations
1
Primary Topic
Geometric and Algebraic Topology
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Crossing numbers of cable knots

Efstratia Kalfagianni, Rob Mcconkey
1 citations
Bulletin of the London Mathematical Society
Geometric and Algebraic Topology
article

Crossing numbers of cable knots

Efstratia Kalfagianni, Rob Mcconkey
article en
1 citations

Abstract

Abstract We use the degree of the colored Jones knot polynomials to show that the crossing number of a ‐cable of an adequate knot with crossing number is larger than . As an application, we determine the crossing number of 2‐cables of adequate knots. We also determine the crossing number of the connected sum of any adequate knot with a 2‐cable of an adequate knot.

Bulletin of the London Mathematical SocietyVol. 56(11)
Colorado State University Pueblo (US), Michigan State University (US)
National Science Foundation
Openalex Percentile: Top 77%
Geometric and Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.