Math-3191 · mathematics · Topology

Math-3191

Kirby Problem 1.64

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Shared notation.
$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.

A positively transverse oriented link $L$ in standard contact $(S^3,\xi_{\mathrm{std}})$ is everywhere transverse to the contact planes. The cyclic $n$-fold cover $\Sigma_n(L)$ branched along $L$ has the induced contact structure $\xi_L$: away from the branch set it lifts $\xi_{\mathrm{std}}$, with the usual contact extension near that set. Stein fillability means that this contact manifold is the strictly pseudoconvex boundary of a compact Stein surface. A quasipositive braid is a product of conjugates of positive Artin generators $\sigma_i$ in a braid group; its closure has a natural transverse realization. The self-linking number $\operatorname{sl}(L)$ is the contact push-off linking number computed using a nonzero section over a spanning surface. Slice-Bennequin sharpness means that some smooth compact oriented properly embedded surface $F\subset B^4$, with $\partial F=L$ and no closed components, satisfies $\operatorname{sl}(L)=-\chi(F)$; $\chi$ denotes Euler characteristic.

Statement recorded in the supplied source.
If $(\Sigma_2(L),\xi_L)$ is Stein fillable, must $L$ be transversely isotopic to the closure of a quasipositive braid? Does the same implication hold if $(\Sigma_n(L),\xi_L)$ is Stein fillable for some integer $n>2$? For a Stein-fillable cyclic branched cover, must the slice-Bennequin inequality for this transverse link be sharp? [S2]

Short English statement

Does Stein fillability of a double or higher cyclic contact branched cover force quasipositivity of the transverse link and sharpness of its slice-Bennequin bound?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.