arXiv · 0908.2745
Computable bounds for Rasmussen's concordance invariant
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Andrew Lobb. 2009-09-09. Computable bounds for Rasmussen's concordance invariant. https://doi.org/10.1112/s0010437x10005117
Cite the original work for its findings. Save a collection to share your selection of sources.