Related papers: Complexity, Heegaard diagrams and generalized Dunw…
The idea of computing Matveev complexity by using Heegaard decompositions has been recently developed by two different approaches: the first one for closed 3-manifolds via crystallization theory, yielding the notion of Gem-Matveev…
We consider closed orientable 3-dimensional hyperbolic manifolds which are cyclic branched coverings of the 3-sphere, with branching set being a two-bridge knot (or link). We establish two-sided linear bounds depending on the order of the…
The notion of Gem-Matveev complexity has been introduced within crystallization theory, as a combinatorial method to estimate Matveev's complexity of closed 3-manifolds; it yielded upper bounds for interesting classes of such manifolds. In…
Using the theory of hyperbolic manifolds with totally geodesic boundary, we provide for every integer n greater than 1 a class of such manifolds all having Matveev complexity equal to n and Heegaard genus equal to n+1. All the elements of…
We extend Matveev's theory of complexity for 3-manifolds, based on simple spines, to (closed, orientable, locally orientable) 3-orbifolds. We prove naturality and finiteness for irreducible 3-orbifolds, and, with certain restrictions and…
We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…
We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…
We give an upper bound for the Matveev complexity of the whole class of closed connected orientable prime graph manifolds that is sharp for all 14502 graph manifolds of the Recognizer catalogue (available at…
We discuss 3-manifolds which are cyclic coverings of the 3-sphere, branched over 2-bridge knots and links. Different descriptions of these manifolds are presented: polyhedral, Heegaard diagram, Dehn surgery and coloured graph constructions.…
We study complexities of 3-manifolds defined from triangulations, Heegaard splittings, and surgery presentations. We show that these complexities are related by linear inequalities, by presenting explicit geometric constructions. We also…
We give upper bounds of the Matveev complexities of two-bridge link complements by constructing their spines explicitly. In particular, we determine the complexities for an infinite sequence of two-bridge links corresponding to the…
Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…
We give a summary of known results on Matveev's complexity of compact 3-manifolds. The only relevant new result is the classification of all closed orientable irreducible 3-manifolds of complexity 10.
In this paper we show that all 3-manifolds of a family introduced by M. J. Dunwoody are cyclic coverings of lens spaces (eventually $\bf S^3$), branched over genus one 1-bridge knots. As a consequence, we give a positive answer to the…
We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…
We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…
By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing…
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…
We provide combinatorial realizations, according to the usual objects/moves scheme, of the following three topological categories: (1) pairs (M,v) where M is a 3-manifold (up to diffeomorphism) and v is a (non-singular vector) field, up to…
We present new lower bounds on the complexity of Dehn surgery manifolds of knots, using our recent result on the Cheeger-Gromov rho invariants and triangulations. As an application, we give explicit examples of closed hyperbolic 3-manifolds…