Hostname: page-component-6766d58669-88psn Total loading time: 0 Render date: 2026-05-22T11:38:11.766Z Has data issue: false hasContentIssue false

Computable bounds for Rasmussen’s concordance invariant

Published online by Cambridge University Press:  13 December 2010

Andrew Lobb*
Affiliation:
Mathematics Department, Stony Brook University, Stony Brook, NY 11794, USA (email: lobb@math.sunysb.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Foundation Compositio Mathematica 2010