Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

11223344 · Dec 202519922001200920172026
48 results for 3-manifold triangulations

Researchers found the minimum number of tetrahedra needed to triangulate elliptic and sol 3-manifolds.

problem Finding the minimum number of tetrahedra in triangulations of 3-manifolds.
method Computed the triangulation complexity of all elliptic and sol 3-manifolds, within a bounded error.
result Computed the triangulation complexity of all elliptic and sol 3-manifolds.

0-efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation or M can be shown to be one of the manifolds S^3, RP^3 or L(3,1). Similarly, any triangulation of a compact, orientable, …

2002-07-18abs ↗pdf ↗

We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian manifolds) to obtain triangulations with these properties under various hypotheses…

2014-12-01abs ↗pdf ↗

3-manifold triangulation can be reconstructed from its intersection matrix.

problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.

The study proves poor ideal three-edge triangulations are minimal for certain 3-manifolds.

problem Finding minimal ideal triangulations for specific 3-manifolds.
method Analyzing properties of poor ideal three-edge triangulations and applying them to construct minimal triangulations.
result Poor ideal three-edge triangulations are proven to be minimal for certain 3-manifolds.

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 these 41 different triangulations are identified and described in detail, with part…

2003-11-07abs ↗pdf ↗

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 check if a closed orientable 3-manifold, equipped with a minimal triangulation, i…

2004-04-19abs ↗pdf ↗

Efficient triangulations help in understanding 3-manifold boundaries.

problem Understanding boundary slopes in 3-manifolds.
method Introducing and studying boundary-efficient triangulations and inflating ideal triangulations.
result There are only finitely many boundary slopes for incompressible and \(\partial\)-incompressible surfaces in compact 3-manifolds.

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 constructions to take connected sums of triangulated 3-manifolds, we obtain the following re…

2003-07-22abs ↗pdf ↗

A triangulation of a compact 3-manifold is annular-efficient if it is 0-efficient and the only normal, incompressible annuli are thin edge-linking. If a compact 3-manifold has an annular-efficient triangulation, then it is irreducible, boundary-irreducible, and an-annular. Conversely, it is shown that for a compact, ir…

2011-08-15abs ↗pdf ↗

The paper explores algorithms to transform 3-manifold triangulations while controlling sparsity.

problem Designing efficient algorithms for 3-manifold triangulations with controlled sparsity.
method Revisit and apply a linear-time algorithm for converting triangulations into Heegaard diagrams, and present a quasi-linear-time algorithm for retriangulation.
result Quasi-linear-time algorithm producing a Heegaard diagram with controlled sparsity.

The paper finds canonical triangulations for specific 3-manifolds.

problem Finding canonical decompositions for cusped hyperbolic 3-manifolds.
method Showed local convexity at every face of the geometric triangulation.
result Found canonical triangulations for Dehn fillings of the Borromean rings link complement and related manifolds.

Paper finds infinite family of minimal triangulations for complex 3D shapes.

problem Finding minimal ideal triangulations for complex 3D shapes.
method Examined Dehn fillings on specific links to find minimal triangulations.
result Found an infinite family of minimal ideal triangulations for a specific type of 3D shape.

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 3-manifold the number of vertices for minimal contact triangulations for overtwisted …

2016-08-12abs ↗pdf ↗

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 closed orientable hyperbolic 3-manifold that fibres over the circle. We show that the…

2019-10-24abs ↗pdf ↗

Algorithm constructs triangulations for Heegaard splittings and related 3-manifolds.

problem Constructing triangulations for Heegaard splittings and related 3-manifolds.
method Algorithm using Regina to generate triangulations from combinatorial presentations of Heegaard diagrams.
result Triangulations with cutwidth bounded by 4g24g-2 for genus-gg Heegaard splittings.

Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following results: 1) a minimal triangulation of a closed irreducible or a bounded hyperbolic 3-…

2006-06-05abs ↗pdf ↗

Machine learning identifies 3-manifold triangulations using isomorphism signatures.

problem Differentiating and classifying 3-manifolds and their Dehn surgeries.
method Training machine learning models on isomorphism signatures derived from 3-manifold triangulations and Pachner graphs.
result Gradient saliency analysis reveals key parts of the language-like encoding scheme.

This is the second in a series of papers in which we investigate ideal triangulations of the interiors of compact 3-manifolds with tori or Klein bottle boundaries. Such triangulations have been used with great effect, following the pioneering work of Thurston. Ideal triangulations are the basis of the computer program …

2005-02-21abs ↗pdf ↗

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 analysis of layered-triangulations is given in the cases of the solid torus and lens…

2006-03-25abs ↗pdf ↗

3-manifolds have covers with infinitely many ideal triangulations.

problem Proving the existence of infinitely many geometric ideal triangulations in certain 3-manifolds.
method Using separability of peripheral subgroups and conjugacy separability theorems.
result Every cusped hyperbolic 3-manifold has a cover with infinitely many geometric ideal triangulations.

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both the geometry and combinatorics of the triangulation. We prove that detecting ta…

2012-07-04abs ↗pdf ↗

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 we describe a procedure yielding an explicit formula for such a function if the 3…

2003-01-22abs ↗pdf ↗

Unimodal sequences of moves connect 3-manifold triangulations.

problem Understanding the structure of sequences of bistellar flips.
method Examined unimodal sequences of moves that increase and decrease triangulation size.
result Proved that any two one-vertex triangulations are connected by a unimodal sequence of moves.

New method for computing hyperbolic structures on 3-manifolds with torus boundaries.

problem Computing a complete hyperbolic structure on 3-manifolds with torus boundaries.
method Convex optimization and combinatorial modifications to find a triangulation that admits a solution to the gluing equations.
result Experimental results support the new method for modifying triangulations and updating their geometry.

This paper uses combinatorial Ricci flow to tackle Thurston's triangulation conjecture.

problem Thurston's triangulation conjecture for hyperbolic 3-manifolds.
method Combinatorial Ricci flow approach to prove convergence and geometric decompositions.
result Combinatorial Ricci flow converges if and only if the triangulation is geometric.

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the co…

2003-07-30abs ↗pdf ↗

Previous work of the authors studies minimal triangulations of closed 3-manifolds using a characterisation of low degree edges, embedded layered solid torus subcomplexes and 1-dimensional Z2\mathbb{Z}_2-cohomology. The underlying blueprint is now used in the study of minimal ideal triangulations. As an application, it …

2018-08-08abs ↗pdf ↗

This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space L(4k,2k1)L(4k, 2k-1) and the generalised quaternionic space S3/Q4kS^3/Q_{4k} have complexity $k,…

2009-02-28abs ↗pdf ↗

New quantum invariant for framed 3-manifolds using ideal triangulations.

problem Quantum invariants of framed 3-manifolds with vanishing first Betti number.
method Based on ideal triangulations and Hopf algebras, using the pentagon equation and graphical representations.
result Construction of a new quantum invariant for closed framed 3-manifolds.

Proves unique hyperbolic metric for 3-manifolds with ideal triangulation.

problem Proving a unique hyperbolic metric for 3-manifolds with specific triangulations.
method Combining combinatorial Ricci flow with ideal triangulation for pseudo 3-manifolds.
result Extended Ricci flow converges to the hyperbolic metric exponentially fast.

In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of thin position for 3-manifolds, play an important role when studying algorithmic …

2017-12-01abs ↗pdf ↗

A celebrated result concerning triangulations of a given closed 3-manifold is that any two triangulations with the same number of vertices are connected by a sequence of so-called 2-3 and 3-2 moves. A similar result is known for ideal triangulations of topologically finite non-compact 3-manifolds. These results build o…

2018-12-06abs ↗pdf ↗

Researchers prove a conjecture linking 1-loop invariants to torsion for fibered 3-manifolds.

problem Proving a conjecture about polynomial invariants and torsion for fibered 3-manifolds.
method Using combinatorial data of ideal triangulations and layered triangulations of fibered 3-manifolds with toroidal boundary, proving the conjecture for specific cases and confirming it for a large number of nonfibered manifolds.
result The conjecture linking 1-loop invariants to torsion for fibered 3-manifolds with toroidal boundary is proven.

It is well known that a triangulation of a closed 2-manifold is tight with respect to a field of characteristic two if and only if it is neighbourly; and it is tight with respect to a field of odd characteristic if and only if it is neighbourly and orientable. No such characterization of tightness was previously known …

2014-12-01abs ↗pdf ↗

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 which contain no fibred submanifolds as strongly simple pieces of their JSJ-deco…

2003-06-06abs ↗pdf ↗