Symmetric ribbon numbers of low-complexity knots
Abstract
Every knot K ⊂ S3 that admits a symmetric union presentation bounds an immersed ribbon disk in S3, while the converse is an open problem due to Christoph Lamm. The symmetric ribbon number rs(K) of K is the minimum number of ribbon singularities in any symmetric ribbon disk bounded by K. In this paper, we undertake a systematic investigation of symmetric ribbon numbers of knots with at most 12 crossings. Along the way, we exhibit novel lower bounds for rs(K) arising from knot determinants, Alexander polynomials, Jones polynomials, and Kauffman polynomials.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.