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,657 papers · 148 categories

Trend · papers per month

36912 · Nov 202019922001200920172026
48 results for triangulation

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 tight triangulated manifolds are stacked. It is known that locally stacked tight t…

2015-06-01abs ↗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.

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 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 ↗

Agol recently introduced the concept of a veering taut triangulation, which is a taut triangulation with some extra combinatorial structure. We define the weaker notion of a "veering triangulation" and use it to show that all veering triangulations admit strict angle structures. We also answer a question of Agol, givin…

2010-11-16abs ↗pdf ↗

Minimal triangulations for 229 hyperbolic census knots discovered.

problem Finding minimal triangulations for hyperbolic census knots.
method Ideal triangulations of the magic manifold, low-complexity triangulations for partial fillings, sorting into families.
result Minimal triangulations for 229 hyperbolic census knots discovered, conjectured to be minimal for all 42 families.

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In…

2004-03-25abs ↗pdf ↗

The paper constructs triangulations for double twist knots using geometric methods.

problem Constructing explicit triangulations of double twist knots.
method Using triangulating Dehn fillings, layered solid tori, and their double covers.
result Proves both triangulations are geometric, using conjecturally minimal triangulation to present A-polynomial equations.

New bounds show triangulated surfaces are evenly distributed in moduli space.

problem Distribution of triangulated surfaces in moduli space as genus increases.
method Proved upper and lower bounds for the number of triangulated surfaces in Teichmüller balls.
result Number of triangulated surfaces in a Teichmüller unit ball is at most exponential in the number of triangles, independent of genus.

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds on distance between triangulations that only depend on the topology of the surfac…

2015-09-14abs ↗pdf ↗

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.

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected. We give upper bounds on the number of edge f…

2019-12-10abs ↗pdf ↗

A geometric triangulation of a Riemannian manifold is a triangulation where the interior of each simplex is totally geodesic. Bistellar moves are local changes to the triangulation which are higher dimensional versions of the flip operation of triangulations in a plane. We show that geometric triangulations of a compac…

2019-07-04abs ↗pdf ↗

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 its "minimal layered triangulation." This paper proves that for each integer n>1…

2008-05-16abs ↗pdf ↗

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 ↗

Minimal Delaunay triangulations on hyperbolic surfaces have linear number of vertices.

problem Finding the minimum number of vertices in Delaunay triangulations of hyperbolic surfaces.
method Analyzing the genus gg of hyperbolic surfaces to derive bounds on the number of vertices.
result The number of vertices in minimal Delaunay triangulations of hyperbolic surfaces is linear in the genus gg.

Software simplifies triangulations of 4-manifolds, revealing exotic structures.

problem Understanding smooth 4-manifolds from discrete and algorithmic perspectives.
method New software tools, including an algorithm for triangulations from Kirby diagrams and a heuristic for simplification.
result Presented new triangulations of exotic pairs, corks, and plugs, including the smallest known K3 surface.

Essential triangulations of certain manifolds are connected via specific moves.

problem Connecting essential triangulations of certain manifolds.
method Essential triangulations are connected via 2-3 and 3-2 moves alone, ignoring those for which no 2-3 move preserves essentiality.
result Essential triangulations of certain manifolds are connected via 2-3 and 3-2 moves alone.

We study several properties of $\ZZ_2^n$-equivariant triangulations of $\RR P^n$. We show that a $\ZZ_2^n$-equivariant triangulation of $\RR P^n$ induces a triangulated subdivision of the orbit space n\bigtriangleup^n. We show that any vertex minimum $\ZZ_2^3$-equivariant triangulation of $\RR P^3$ contains 1111 verti…

2013-06-12abs ↗pdf ↗

New triangulations of quaternionic projective plane found with various symmetry groups.

problem Classifying triangulations of quaternionic projective plane with 15 vertices.
method Constructing and classifying 15-vertex triangulations with various symmetry groups.
result Exactly 75 triangulations of quaternionic projective plane with 15 vertices and symmetry group of order at least 4.

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.

Study on veering triangulations and their flow graphs, proving new applications.

problem Understanding the structure of veering triangulations and their flow graphs.
method Analyzing the infinitesimal components of the flow graph associated with veering triangulations.
result Infinitesimal components of veering triangulations' flow graphs have specific forms related to subsets called 'walls'.

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 ↗

In 1983, Banchoff and Kuhnel constructed a minimal triangulation of $\CP^2$ with 9 vertices. $\CP^3$ was first triangulated by Bagchi and Datta in 2012 with 18 vertices. Known lower bound on number of vertices of a triangulation of $\CP^n$ is 1+(n+1)221 + \frac{(n + 1)^2}{2} for n3n \geq 3. We give explicit construction of so…

2014-05-11abs ↗pdf ↗

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 given pl manifold. (ii) Given positive integers nn and dd, construction of nn

2007-01-25abs ↗pdf ↗

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 ↗

Extends circle pattern theorem to quasi-simplicial triangulations.

problem Characterize circle patterns on quasi-simplicial triangulated surfaces.
method Use finite covering technique to reduce problem to simplicial case, prove characterization by KAT inequalities.
result Curvature image is characterized by KAT inequalities.

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 ↗

The paper explores triangulations of spheres and projective spaces, focusing on Hopf triangulations and equilibrium structures.

problem Investigating simplicial versions of sphere decompositions and their applications to projective spaces.
method Developing Hopf triangulations and equilibrium triangulations of spheres and projective spaces, focusing on the central torus and its properties.
result No perfect equilibrium triangulation of CP3\mathbb{C}P^3 exists, while CP2\mathbb{C}P^2 has a unique perfect equilibrium triangulation.