Classification of broken Lefschetz fibrations with small fiber genera (Q500076): Difference between revisions

A broken Lefschetz fibration, which is a generalization of a Lefschetz fibration, is a Lefschetz fibration with indefinite fold singularities. Any smooth map of a 4-manifold to the 2-sphere is homotopic to a broken Lefschetz fibration satisfying that the fold singularities are connected and the Lefschetz singularities are contained in the higher genus part. These fibrations are called simplified broken Lefschetz fibrations. This paper's main result is the classification of genus one simplified broken Lefschetz fibrations. Classically, the classification of genus one Lefschetz fibrations was done by [\textit{A. Kas}, Complex Anal. algebr. Geom., Collect. Pap. dedic. K. Kodaira, 107--111 (1977; Zbl 0351.14017)], [\textit{B. Moishezon}, Complex surfaces and connected sums of complex projective planes. Berlin-Heidelberg-New York: Springer-Verlag (1977; Zbl 0392.32015)], and [\textit{Y. Matsumoto}, Topology 25, 549--563 (1986; Zbl 0615.14023)]. \textit{K. Hayano} [Algebr. Geom. Topol. 11, No. 3, 1267--1322 (2011; Zbl 1229.57017)] classified genus one simplified broken Lefschetz fibrations with less than six singularities, and after that, also obtained a complete classification in [Hiroshima Math. J. 44, No. 2, 223--234 (2014; Zbl 1396.57029)]. The present paper gives another proof. The main part of this paper is the classification of genus one Lefschetz fibrations over the 2-disk with non-trivial global monodromies. The classification uses a graphical method by charts. This is the true worth in the present paper. Charts were originally a method to describe surface braids in 4-space. See, e.g. \textit{S. Kamada}'s book [Braid and knot theory in dimension four. Mathematical Surveys and Monographs. 95. Providence, RI: American Mathematical Society (AMS) (2002; Zbl 0993.57012)]. This method was also useful to classify genus one Lefschetz fibrations in the paper [\textit{S. Kamada, Y. Matsumoto, T. Matumoto} and \textit{K. Waki}, J. Math. Soc. Japan 57, No. 2, 537--555 (2005; Zbl 1080.57022)]. The graphs here are built from several degree-1, -6, and -12 vertices, boundary vertices and oriented labeled edges on a disk. Besides, the graph is associated with local moves, which are called chart moves. The moves are basically the same as the ones of the surface braids case. The proof is to show that any graph over the disk can by some chart moves be reduced to a union of several nucleons (a certain chart) and arcs connecting boundary vertices and degree-1 vertices.