AUTOMATIC COMPUTATION OF CROSSCAP NUMBER OF ALTERNATING KNOTS

DOI10.17654/0972415X23004arXiv2303.09996OpenAlexW4377823792WikidataQ121341183 ScholiaQ121341183MaRDI QIDQ6170185FDOQ6170185

Authors: Kaito Yamada, Noboru Ito 

Publication date: 15 August 2023

Published in: JP Journal of Geometry and Topology (Search for Journal in Brave)

Abstract: We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot $K$, let $calE$ be the number of edges of its diagram. Then there exists a code such that the complexity of this computation of the crosscap number of $K$ is estimated by $O(cal{E}^3)$.

Full work available at URL: https://arxiv.org/abs/2303.09996

Recommendations

• Low complexity algorithms in knot theory
• Crosscap number of knots and volume bounds
• Computing the crosscap number of a knot using integer programming and normal surfaces
• Crosscap numbers of alternating knots via unknotting splices
• Slope norm and an algorithm to compute the crosscap number

zbMATH Keywords

alternating knotcrosscap numberautomatic computation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Knot theory (57K10)

Cites Work

• Incompressible surfaces in 2-bridge knot complements
• Crosscap numbers of pretzel knots
• Crosscap numbers of torus knots.
• Crosscap numbers of 2-bridge knots
• Crosscap numbers and the Jones polynomial
• Crosscap number three alternating knots
• Crosscap number and knot projections
• Crosscap number of knots and volume bounds
• Crosscap numbers of alternating knots via unknotting splices
• PLUMBING AND COMPUTATION OF CROSSCAP NUMBER

Cited In (1)

• Slope norm and an algorithm to compute the crosscap number

This page was built for publication: AUTOMATIC COMPUTATION OF CROSSCAP NUMBER OF ALTERNATING KNOTS

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