Search arXivSearch

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

BibTeXRIS

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.

KEEP EXPLORING

Related papers

The Burau representation of the braid group is faithful for n = 4

In this paper we use ideas introduced earlier by Moody, Long, Long-Paton, and Bigelow to prove the theorem of the title, that the Burau representation of the classical braid group is faithful for n = 4. An immediate corollary is that the Jones representation of the braid group is also faithful for n = 4.

math.GT

The Lorenz braid index and hyperbolic volume

A result of Futer, Kalfagianni, and Purcell implies that an upper volume bound for all link complements in the 3-sphere cannot depend solely on the braid index. In this paper, we introduce the Lorenz braid index and generalise the bunch algorithm to provide a general upper volume bound for all link complements in the 3-sphere. Such an upper bound is a quadratic polynomial in the Lorenz braid index. In addition, we construct an explicit family of hyperbolic Lorenz knots for which the classical braid index and the Seifert genus both tend to infinity, while the Lorenz braid index remains bounded.

math.GT