Automatic computation of crosscap number of alternating knots

2023/03/17 by Kaito Yamada, Noboru Ιτο, Yamada, Kaito +1
Computer Science · Mathematics · #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Logic, programming, and type systems #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2303.09996

openalex publication_date 2023/03/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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(\calE³).

Related

• Linear Bounds of the Crosscap Number of Knots
• Crosscap numbers of alternating links via state codes
• Average crosscap number of a 2-bridge knot
• Crosscap numbers of 2-bridge knots
• The Combinatorics of Alternating Tangles: from theory to computerized enumeration