Ask a Question

Prefer a chat interface with context about you and your work?

Computable bounds for Rasmussen’s concordance invariant

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 …