Carlo Petronio
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 subtleties, additivity under orbifold connected sum. We also develop the theory of handle decompositions for 3-orbifolds and the corresponding theory of normal 2-suborbifolds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 this paper we extend the definition to the case of non-empty boundary and prove that for each compact irreducible and boundary-irreducible 3-manifold it coincides with the modified Heegaard complexity introduced by Cattabriga, Mulazzani and Vesnin. Moreover, via Gem-Matveev complexity, we obtain an estimation of Matveev's complexity for all Seifert 3-manifol…
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 crystallization catalogue C^{28}, due to Lins, is used to obtain upper bounds for the complexity of closed orientable 3-manifolds triangulated by at most 28 tetrahedra. The experimental results actually coincide with the exact values of complexity, for all but three elements. Moreover, in the case of at most 26 tetrahedra, the exact value of the complexity is shown to…
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 complexity; the other one for compact orientable 3-manifolds via generalized Heegaard diagrams, yielding the notion of modified Heegaard complexity. In this paper we extend to the non-orientable case the definition of modified Heegaard complexity and prove that for closed 3-manifolds Gem-Matveev complexity and modified Heegaard complexity coincide. Hence, they turn o…
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 are generalizations of Dunwoody manifolds, including cyclic branched coverings of two-bridge knots and links, torus knots, some pretzel knots, and some theta-graphs. Using modified Heegaard complexity, we obtain upper bounds for their Matveev complexity, which linearly depend on the order of the covering. Moreover, using homology arguments due to Matveev and…
Prime knots of genus one admitting diagram with at most five classical crossings were classified by Akimova and Matveev in 2014. In 2018 Kaur, Prabhakar and Vesnin introduced families of L-polynomials and F-polynomials for virtual knots which are generalizations of affine index polynomial. Here we introduce a notion of totally flat-trivial knots and demonstrate that for such knots F-polynomials and L-polynomials coincide with affine index polynomial. We prove that all Akimova - Matveev knots are totally flat-trivial and calculate their affine index polynomials.
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, $ε$-invariants for these manifolds are calculated.
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 \texttt{http://matlas.math.csu.ru/?page=search}).
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.
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 that the upper bounds on Matveev's complexity implied by our computations are sharp for thousands of manifolds, and we conjecture they are for infinitely many, including all Seifert manifolds. Our computations and estimates apply to all the Dehn fillings of M6_1^3 (the complement of the three-component chain-link, conjectured to be the smallest triply cusped hy…
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 complexity for virtual 3-manifolds presented by special polyhedra with one or two $2$-components. On the basis of these results, we establish the exact values of the complexity for a wide class of hyperbolic $3$-manifolds with totally geodesic boundary.
We establish a lower bound on the complexity orientable locally orientable geometric 3-orbifolds in terms of Delzant's T-invariants of their orbifold-fundamental groups, generalizing previously known bounds for complexity of 3-manifolds.
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 this class have a single boundary component of genus n, and the numbers of distinct members of the class grows at least exponentially with n.
Within crystallization theory, (Matveev's) complexity of a 3-manifold can be estimated by means of the combinatorial notion of GM-complexity. In this paper, we prove that the GM-complexity of any lens space L(p,q), with p greater than 2, is bounded by S(p,q)-3, where S(p,q) denotes the sum of all partial quotients in the expansion of q/p as a regular continued fraction. The above upper bound had been already established with regard to complexity; its sharpness was conjectured by Matveev himself and has been recently proved for some infinite families of lens spaces by Jaco, Rubinstein and Tillm…
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 interesting properties: it is subadditive under connected sum and finite-to-one on P2-irreducible manifolds. Moreover, for P2-irreducible manifolds, it equals the minimal number of cubes in a cubulation of the manifold, except for the sphere S3, the projective space RP3 and the lens space L41, which have surface-complexity zero. We will also give estimations of…
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 triangulation of $M^3$. An approach to estimating $c(M^3)$ from below for total spaces of torus bundles over $S^1$, based on the study of theta-curves in the fibers, is developed, and pseudominimal special spines for these manifolds are constructed, which we conjecture to be their minimal spines. We also show how to apply some of these ideas to other 3-manifolds.
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 covering for the Matveev complexity of the covering manifold. The lower estimate uses the hyperbolic volume and results of Cao-Meyerhoff and Gueritaud-Futer (who recently improved previous work of Lackenby), while the upper estimate is based on an explicit triangulation, which also allows us to give a bound on the Delzant T-invariant of the fundamental group …
We find the exact values of complexity for an infinite series of 3-manifolds. Namely, by calculating hyperbolic volumes, we show that c(N_n)=2n, where $c$ is the complexity of a 3-manifold and N_n is the total space of the punctured torus bundle over S^1 with monodromy 2&1 1&1 ^n$. We also apply a recent result of Matveev and Pervova to show that c(M_n) \ge 2Cn with C\approx 0.598, where a compact manifold M_n is the total space of the torus bundle over S^1 with the same monodromy as N_n, and discuss an approach to the conjecture c(M_n)=2n+5 based on the equality c(N_n)=2n.
A complexity of compact 3-manifold via immersed surfaces
本文通过Dehn曲面定义紧致3-流形的曲面复杂度不变量，证明其满足连通和次可加性及有限对一性质，并建立其与立方剖分、理想三角剖分和Matveev复杂度之间的关系。
A theory of complexity for pairs (M,G) with M an arbitrary closed 3-manifold and G a 3-valent graph in M was introduced by the first two named authors, extending the original notion due to Matveev. The complexity c is known to be always additive under connected sum away from the graphs, but not always under connected sum along (unknotted) arcs of the graphs. In this article we prove the slightly surprising fact that if in M there is a sphere intersecting G transversely at one point, and this point belongs to an edge e of G, then e can be canceled from G without affecting the complexity. Using …
We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such manifold, by recognizing its canonical decomposition into Seifert fibred spaces and hyperbolic manifolds. The algorithm relies on the extension of Matveev's theory of complexity to the case of manifolds bounded by suitably marked tori, and on the notion of assembling of two such manifolds. We show that every manifold is an assembling of manifolds which cannot…
We introduce a natural-valued complexity c(X) for pairs X=(M,L), where M is a closed orientable 3-manifold and L is a link contained in M. The definition employs simple spines, but for well-behaved X's we show that c(X) equals the minimal number of tetrahedra in a triangulation of M containing L in its 1-skeleton. Slightly adapting Matveev's recent theory of roots for graphs, we carefully analyze the behaviour of c under connected sum away from and along the link. We show in particular that c is almost always additive, describing in detail the circumstances under which it is not. To do so we i…
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 under the most common topological operations (handle additions, finite coverings, drilling and surgery of spheres, products, connected sums) and its relations with some geometric invariants (Gromov norm, spherical volume, volume entropy, systolic constant). Complexity distinguishes some homotopically equivalent manifolds and is positive on all closed aspheri…
Volume is a natural measure of complexity of a Riemannian manifold. In this survey, we discuss the results and conjectures concerning n-dimensional hyperbolic manifolds and orbifolds of small volume.
Crushing Surfaces of Positive Genus
本文首次分析了正 genus 封闭本质表面的压缩拓扑影响，并探讨了其在三角剖分复杂性与 JSJ 分解关系中的应用。
Let M be a (possibly non-orientable) compact 3-manifold with (possibly empty) boundary consisting of tori and Klein bottles. Let $X\subset\partial M$ be a trivalent graph such that $\partial M\setminus X$ is a union of one disc for each component of $\partial M$. Building on previous work of Matveev, we define for the pair (M,X) a complexity c(M,X) and show that, when M is closed, irreducible and P^2-irreducible, $c(M,\emptyset)$ is the minimal number of tetrahedra in a triangulation of M. Moreover c is additive under connected sum, and, given any n>=0, there are only finitely many irreducible…
We classify all closed non-orientable P2-irreducible 3-manifolds with complexity up to 7, fixing two mistakes in our previous complexity-up-to-6 classification. We show that there is no such manifold with complexity less than 6, five with complexity 6 (the four flat ones and the filling of the Gieseking manifold, which is of type Sol, and three with complexity 7 (one manifold of type Sol, and the two manifolds of type H2xR with smallest base orbifolds).
We notice that a generic nonsingular gradient field $v = \nabla f$ on a compact 3-fold $X$ with boundary canonically generates a simple spine $K(f, v)$ of $X$. We study the transformations of $K(f, v)$ that are induced by deformations of the data $(f, v)$. We link the Matveev complexity $c(X)$ of $X$ with counting the \emph{double-tangent} trajectories of the $v$-flow, i.e. the trajectories that are tangent to the boundary $\d X$ at a pair of distinct points. Let $gc(X)$ be the minimum number of such trajectories, minimum being taken over all nonsingular $v$'s. We call $gc(X)$ the \emph{gradie…
Geometrical spines are defined for 3-manifolds with natural metrics, in particular, for lens manifolds. We show that any spine of L(p,q) close enough to its geometrical spine (i.e., to the cut locus with respect to the standard metric) contains at least E(p,q)-3 vertices, which is exactly the conjectured value for Matveev's complexity of L(p,q); here E(p,q) stands for the sum of the elements of the continued fraction expansion of p/q. As a byproduct, we find the minimal (over all triangulations) rotation distance (the term coined by Sleator, Tarjan, and Thurston) between a triangulation of a r…
Vertex Bounds in Triangulated $d$-Manifolds and an Application to 4-Manifold Complexity
研究奇数维流形三角化的顶点数上界，证明v ≤ n + (d-1)/2且紧；对偶数维猜想v ≤ n/2 + d，在平衡三角化等情形下验证，并应用于单连通4流形复杂度下界2β₂(M) ≤ n。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。