Convex Decomposition Theory 3
نویسنده
چکیده
We use convex decomposition theory to (1) reprove the existence of a universally tight contact structure on every irreducible 3-manifold with nonempty boundary, and (2) prove that every toroidal 3-manifold carries infinitely many nonisotopic, nonisomorphic tight contact structures. It has been known for some time that there are deep connections between the theory of taut foliations and tight contact structures due to the work of Eliashberg and Thurston [7]. In particular, they proved that a taut foliation can be perturbed into a (universally) tight contact structure. In a previous paper [19] we introduced the notion of convex decompositions and explained how convex decompositions can naturally be viewed as generalizations of sutured manifold decompositions introduced by Gabai in [8]. In this paper we take the viewpoint that convex decompositions are completely natural in 3-dimensional contact topology and that many theorems can be proven directly in the category of tight contact manifolds with convex splittings as morphisms. The first theorem of the paper is a version of a theorem by Gabai-Eliashberg-Thurston in the case of manifold with boundary: Theorem 0.1 (Gabai-Eliashberg-Thurston). Let (M, γ) be an oriented, compact, connected, irreducible, sutured 3-manifold which has boundary, is taut, and has annular sutures. Then (M, γ) carries a universally tight contact structure. We provide an alternate proof which (1) does not require us to perturb taut foliations into tight contact structures as we did in [19] and (2) does not resort to four-dimensional symplectic filling techniques in order to prove tightness. Instead, we use Gabai’s sutured manifold decomposition and directly apply a gluing theorem (Theorem 1.6). To prove the gluing theorem we apply key ideas from Colin’s papers [3] and [4] in the context of convex decomposition theory. We also apply similar ideas to prove the following theorem: Theorem 0.2. Let M be an oriented, closed, connected, irreducible 3-manifold which contains an incompressible torus. Then M carries infinitely many isomorphism classes of universally tight contact structures. This theorem confirms a conjecture which has its beginnings in the works of Giroux [10] and Kanda [23], was proved for torus bundles over S by Giroux [11], and was extended Date: This version: January 31, 2001. 1991 Mathematics Subject Classification. Primary 57M50; Secondary 53C15.
منابع مشابه
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is ...
متن کاملA Geometric Study of the Split Decomposition
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave functions, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics...
متن کاملGeometric Study on the Split Decomposition of Finite Metrics
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave function, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics ...
متن کاملPath Partitions, Cycle Covers and Integer Decomposition
A polyhedron P has the integer decomposition property, if every integer vector in kP is the sum of k integer vectors in P . We explain that the projections of polyhedra defined by totally unimodular constraint matrices have the integer decomposition property, in order to deduce the same property for coflow polyhedra defined by Cameron and Edmonds. We then apply this result to the convex hull of...
متن کاملDecomposition for Efficient Eccentricity Transform of Convex Shapes
The eccentricity transform associates to each point of a shape the shortest distance to the point farthest away from it. It is defined in any dimension, for open and closed manyfolds. Top-down decomposition of the shape can be used to speed up the computation, with some partitions being better suited than others. We study basic convex shapes and their decomposition in the context of the continu...
متن کامل