中文
相关论文

相关论文: Simplification paths in the Pachner graphs of clos…

200 篇论文

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

几何拓扑 · 数学 2011-06-16 Benjamin A. Burton

A key result in computational 3-manifold topology is that any two triangulations of the same 3-manifold are connected by a finite sequence of bistellar flips, also known as Pachner moves. One limitation of this result is that little is…

几何拓扑 · 数学 2025-10-10 Benjamin A. Burton , Alexander He

In this paper we describe a procedure to simplify any given triangulation of the 3-sphere using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new…

几何拓扑 · 数学 2007-05-23 Aleksandar Mijatovic

We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of…

几何拓扑 · 数学 2024-03-08 Benjamin A. Burton , Alexander He

A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…

几何拓扑 · 数学 2019-09-10 Benjamin A. Burton , William Pettersson

Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing…

几何拓扑 · 数学 2011-11-29 Benjamin A. Burton

It was recently shown that there exists an explicit bound for the number of Pachner moves needed to connect any two triangulation of any Haken 3-manifold which contains no fibred sub-manifolds as strongly simple pieces of its…

几何拓扑 · 数学 2007-05-23 Aleksandar Mijatovic

It is not known whether there exists a computable function bounding the number of Pachner moves needed to connect any two triangulation of a compact 3-manifold. In this paper we find an explicit bound of this kind for all Haken 3-manifolds…

几何拓扑 · 数学 2007-05-23 Aleksandar Mijatovic

A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…

几何拓扑 · 数学 2010-12-21 Benjamin A. Burton

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

We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…

组合数学 · 数学 2023-10-17 Eduardo G. Altmann , Jonathan Spreer

The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…

几何拓扑 · 数学 2020-12-22 D. A. Fedoseev , I. M. Nikonov , V. O. Manturov

Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices,…

几何拓扑 · 数学 2016-09-21 Henry Segerman

It is not completely unreasonable to expect that a computable function bounding the number of Pachner moves needed to change any triangulation of a given 3-manifold into any other triangulation of the same 3-manifold exists. In this paper…

几何拓扑 · 数学 2007-05-23 Aleksandar Mijatovic

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

Real 3-manifold triangulations can be uniquely represented by isomorphism signatures. Databases of these isomorphism signatures are generated for a variety of 3-manifolds and knot complements, using SnapPy and Regina, then these…

几何拓扑 · 数学 2025-03-18 Francesco Costantino , Yang-Hui He , Elli Heyes , Edward Hirst

In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…

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

It is well known that every compact oriented 3-manifold admits an ideal triangulation, and that any two such triangulations with at least two ideal tetrahedra are related by a sequence of Pachner $2$-$3$ moves. Motivated by constructions in…

几何拓扑 · 数学 2026-05-29 Stavros Garoufalidis , Rinat Kashaev , Sakie Suzuki

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

Through computer enumeration with the aid of topological results, we catalogue all 18 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most eight tetrahedra. In addition we give an overview as to how the 100…

几何拓扑 · 数学 2010-12-21 Benjamin A. Burton
‹ 上一页 1 2 3 10 下一页 ›