中文
相关论文

相关论文: Coverings and Minimal Triangulations of 3-Manifold…

200 篇论文

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…

几何拓扑 · 数学 2014-02-26 William Jaco , J. Hyam Rubinstein , Stephan Tillmann

The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…

几何拓扑 · 数学 2022-12-12 Marc Lackenby , Jessica S. Purcell

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

几何拓扑 · 数学 2023-01-06 Adele Jackson

A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed…

几何拓扑 · 数学 2007-05-23 William Jaco , J. Hyam Rubinstein

A new lower bound on the complexity of a 3-manifold is given using the Z2-Thurston norm. This bound is shown to be sharp, and the minimal triangulations realising it are characterised using normal surfaces consisting entirely of…

几何拓扑 · 数学 2009-06-29 William Jaco , J. Hyam Rubinstein , Stephan Tillmann

In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…

几何拓扑 · 数学 2009-09-29 Alexander Barchechat

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…

几何拓扑 · 数学 2017-12-06 Maria Rita Casali , Paola Cristofori

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

组合数学 · 数学 2007-05-23 Adam Bliss , Francis Edward Su

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…

几何拓扑 · 数学 2020-03-11 William Jaco , J. Hyam Rubinstein , Jonathan Spreer , Stephan Tillmann

How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.

几何拓扑 · 数学 2025-05-06 Natalia S. Dergacheva , Anton A. Klyachko

We construct a simple topological invariant of certain 3-manifolds, including quotients of the 3-sphere by finite groups, based on the fact that the tangent bundle of an orientable 3-manifold is trivialisable. This invariant is strong…

几何拓扑 · 数学 2007-05-23 Siddhartha Gadgil

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

We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.

几何拓扑 · 数学 2007-05-23 Frank H. Lutz

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

It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…

几何拓扑 · 数学 2007-05-23 Simon A. King

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

几何拓扑 · 数学 2007-05-23 Basudeb Datta

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong…

几何拓扑 · 数学 2015-12-23 Feng Luo , Stephan Tillmann

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…

几何拓扑 · 数学 2015-06-02 Basudeb Datta

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

组合数学 · 数学 2007-05-23 Frank H. Lutz

In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented…

几何拓扑 · 数学 2016-08-15 Basudeb Datta , Dheeraj Kulkarni
‹ 上一页 1 2 3 10 下一页 ›