中文
相关论文

相关论文: 3-Manifolds with complexity at most 9

200 篇论文

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…

几何拓扑 · 数学 2011-09-06 Bruno Martelli , Carlo Petronio

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.

几何拓扑 · 数学 2011-09-06 Bruno Martelli

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…

几何拓扑 · 数学 2007-05-23 Bruno Martelli , Carlo Petronio

In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for…

几何拓扑 · 数学 2008-05-01 Damian Heard , Craig Hodgson , Bruno Martelli , Carlo Petronio

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…

几何拓扑 · 数学 2011-09-06 Bruno Martelli

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…

几何拓扑 · 数学 2019-01-30 Gennaro Amendola

We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…

几何拓扑 · 数学 2009-09-25 Sergei V. Matveev

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…

几何拓扑 · 数学 2011-09-06 Gennaro Amendola , Bruno Martelli

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…

几何拓扑 · 数学 2011-01-18 Carlo Petronio

We classify all closed non-orientable P2-irreducible 3-manifolds having complexity up to 6 and we describe some having complexity 7. We show in particular that there is no such manifold with complexity less than 6, and that those having…

几何拓扑 · 数学 2007-05-23 Gennaro Amendola , Bruno Martelli

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…

几何拓扑 · 数学 2017-12-06 P. Cristofori , E. Fominykh , M. Mulazzani , V. Tarkaev

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…

几何拓扑 · 数学 2025-01-03 Gennaro Amendola

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…

几何拓扑 · 数学 2016-09-23 Evgeny Fominykh , Vladimir Turaev , Andrei Vesnin

Quantum invariants in low dimensional topology offer a wide variety of valuable invariants of knots and 3-manifolds, presented by explicit formulas that are readily computable. Their computational complexity has been actively studied and is…

几何拓扑 · 数学 2025-06-27 Henrique Ennes , Clément Maria

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…

几何拓扑 · 数学 2019-05-02 Alessia Cattabriga , Michele Mulazzani

We study the set of all closed oriented smooth 4-manifolds experimentally, according to a suitable complexity defined using Turaev's shadows. This complexity roughly measures how complicated the 2-skeleton of the 4-manifold is. We…

几何拓扑 · 数学 2018-07-17 Yuya Koda , Bruno Martelli , Hironobu Naoe

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…

几何拓扑 · 数学 2012-03-02 M. R. Casali , P. Cristofori

A special spine of a three-manifold is said to be poor if it does not contain proper simple subpolyhedra. Using the Turaev-Viro invariants, we establish that every compact three-dimensional manifold M with connected nonempty boundary has a…

几何拓扑 · 数学 2015-05-22 Evgeny Fominykh , Vladimir Turaev , Andrei Vesnin

A closed hyperbolic 3-manifold is exceptional if its shortest geodesic does not have an embedded tube of radius $\ln(3)/2$. D. Gabai, R. Meyerhoff and N. Thurston identified seven families of exceptional manifolds in their proof of the…

几何拓扑 · 数学 2007-05-23 Abhijit Champanerkar , Jacob Lewis , Max Lipyanskiy , Scott Meltzer , Alan Reid

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

几何拓扑 · 数学 2024-07-24 Marc Lackenby , Jessica S. Purcell
‹ 上一页 1 2 3 10 下一页 ›