Computable bounds for Rasmussen's concordance invariant
classification
🧮 math.GT
math.QA
keywords
boundscomputableconcordancediagramgiveninvariantrasmussenbennequin-type
read the original abstract
Given a diagram D of a knot K, we give easily computable bounds for Rasmussen's concordance invariant s(K). The bounds are not independent of the diagram D chosen, but we show that for diagrams satisfying a given condition the bounds are tight. As a corollary we improve on previously known Bennequin-type bounds on the slice genus.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.