ProbXiv
Explorersign in
Problem archiveProblem record

Statement

(Smith). Is there an a priori upper bound on the length of any factorization of the boundary twist δ as a product of positive Dehn twists in Mapg,n? Equivalently: is there an upper bound (in terms of the genus only) on the number of singular fibers of a Lefschetz fibration admitting a section of square −1? (In the opposite direction, various lower bounds have been established, see e.g. [ 28]). Unfortunately, it is hard to quantify the amount of rotation induced by a Dehn twist on the boundary of the hyperbolic disc, so it is not clear whether the approach in [ 26] can shed light on this question. More generally, given an element T ∈ Map+ g,n, we can try to study factorizations of T as a product of positive Dehn twists. Geometrically, such factorizations correspond to Lefschetz fibrations over the disc (with bounded fibers), such that the monodromy along the boundary of the disc is the prescribed element T. The boundary of such a Lefschetz fibration is naturally a contact 3-manifold Y equipped with a structure of open book [10], and the total space of the fibration is a Stein filling of Y [1, 10, 15 ]. Hence the classification of factorizations of T in Map g,n is related to (and a subset of) the classification of Stein fillings of the contact 3-manifold Y. Some remarkable results have been obtained recently concerning the classification of symplec- tic fillings of lens spaces or links of singularities, using tools from symplectic geometry, and in particular pseudo-holomorphic curves (see e.g. [ 14, 18 ]); meanwhile, Lefschetz fibrations have 9. Mapping class group factorizations and symplectic 4-manifolds 137 been used to construct examples with infinitely many inequivalent fillings (see e.g. [ 20]). Hence we may ask:

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.