Related papers: A note about complexity of lens spaces

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.

The shadow-complexity is an invariant of closed $4$-manifolds defined by using $2$-dimensional polyhedra called Turaev's shadows, which, roughly speaking, measures how complicated a $2$-skeleton of the $4$-manifold is. In this paper, we…

Virtual $3$-manifolds were introduced by S.V. Matveev in 2009 as natural generalizations of the classical $3$-manifolds. In this paper, we introduce a notion of complexity of a virtual $3$-manifold. We investigate the values of the…

We show that every sequence of torsion-free arithmetic congruence lattices in $\mathrm{PGL}(2,\mathbb R)$ or $\mathrm{PGL}(2,\mathbb C)$ satisfies a strong quantitative version of the Limit Multiplicity property. We deduce that for $R>0$ in…

Let $M$ be a compact 3--manifold with boundary a single torus. We present upper and lower complexity bounds for closed 3--manifolds obtained as even Dehn fillings of $M.$ As an application, we characterise some infinite families of even…

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…

In this sequel to earlier papers by three of the authors, we obtain a new bound on the complexity of a closed 3--manifold, as well as a characterisation of manifolds realising our complexity bounds. As an application, we obtain the first…

For a closed orientable connected 3-manifold $M$, its complexity $\boldsymbol{T}(M)$ is defined to be the minimal number of tetrahedra in its triangulations. Under the assumption that $M$ is prime (but not necessarily atoroidal), we…

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…

The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…

For a 3-dimensional manifold $M^3$, its complexity $c(M^3)$, introduced by S.Matveev, is the minimal number of vertices of an almost simple spine of $M^3$; in many cases it is equal to the minimal number of tetrahedra in a singular…

There are found exact values of (Matveev) complexity for the 2-parameter family of hyperbolic 3-manifolds with boundary constructed by Paoluzzi and Zimmermann. Moreover, $\epsilon$-invariants for these manifolds are calculated.

In this paper, we prove that the systolic volume of a closed aspherical 3-manifold is bounded below in terms of complexity. Systolic volume is defined as the optimal constant in a systolic inequality. Babenko showed that the systolic volume…

Let M be a real analytic manifold modeled on a locally convex space and K be a non-empty compact subset of M. We show that if an open neighborhood of K in M admits a complexification which is a regular topological space, then the germ of…

We deal with Matveev complexity of compact orientable 3-manifolds represented via Heegaard diagrams. This lead us to the definition of modified Heegaard complexity of Heegaard diagrams and of manifolds. We define a class of manifolds which…

Let $\mathcal{P}$ be the class of combinatorial 3-dimensional simple polytopes $P$, different from a tetrahedron, without 3- and 4-belts of facets. By the results of Pogorelov and Andreev, a polytope $P$ admits a realisation in Lobachevsky…

Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…

The present paper is devoted to present a unifying survey about some special classes of crystallizations of compact PL $4$-manifolds with empty or connected boundary, called {\it semi-simple} and {\it weak semi-simple crystallizations},…

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

Heegaard splittings stratify 3-manifolds by complexity; only $S^3$ admits a genus-zero splitting, and only $S^3$, $S^1 \times S^2$, and lens spaces $L(p,q)$ admit genus-one splittings. In dimension four, the second author and Jeffrey Meier…