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.

169,181 papers · 148 categories

Trend · papers per month

2535067581,011 · Jun 202019922001200920182026
48 results for General triangulations

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 ↗

Quasitoric manifolds, introduced by M. Davis and T. Januskiewicz in 1991, are topological generalizations of smooth complex projective spaces. In 1992, Banchoff and Kühnel constructed a 10-vertex equilibrium triangulations of $\CP^2$. We generalize this construction for quasitoric manifolds and construct some equilibri…

2015-07-25abs ↗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.

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 ↗

Recently, Ian Agol introduced a class of "veering" ideal triangulations for mapping tori of pseudo-Anosov homeomorphisms of surfaces punctured along the singular points. These triangulations have very special combinatorial properties, and Agol asked if these are "geometric", i.e. realised in the complete hyperbolic met…

2014-06-25abs ↗pdf ↗

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 before we can make it smaller than its original size. Here we present experimental …

2010-11-18abs ↗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.

Proved contractibility of geodesic triangulation space on hyperbolic surfaces.

problem Open problem on contractibility of geodesic triangulations on hyperbolic surfaces.
method Generalized Tutte's embedding theorem for negative curvature surfaces.
result Contractibility of geodesic triangulation space proved.

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 ↗

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.

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be …

2009-11-26abs ↗pdf ↗

The paper studies triangulations of surfaces up to branched transit equivalences, proving equivalence conditions and foliations.

problem Understanding triangulations of surfaces up to branched transit equivalences.
method Analyzes triangulations of closed surfaces S with vertices V, considering branched triangulations up to b-transit equivalence generated by b-flips.
result Branched triangulations are equivalent under certain conditions, including parity of Euler-Poincare' characteristic c(S).

Let XX be a real analytic orbifold. Then each stratum of XX is a subanalytic subset of XX. We show that XX has a unique subanalytic triangulation compatible with the strata of XX. We also show that every Cr{\rm C}^r-orbifold, 1r1\leq r\leq \infty, has a real analytic structure. This allows us to triangulate differ…

2011-05-01abs ↗pdf ↗

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 paper triangulates Heisenberg groups with horizontal and straight simplexes.

problem Triangulating Heisenberg groups with specific regularity properties.
method Constructing triangulations with horizontal and straight simplexes on a polyhedral structure and extending to the whole Heisenberg group.
result Explicit examples of grid and triangulations provided.

PointTriNet generates 3D triangulations from point clouds efficiently and scalably.

problem Generating a triangulation among a set of points in 3D space.
method Iteratively applies a classification network and a proposal network over nearby points and triangles, using a novel triangle-relative input encoding.
result Generates robust and scalable triangulations for 3D learning pipelines.

Let C(L)C(L) be the right-angled Coxeter group defined by an abstract triangulation LL of S2\mathbb{S}^2. We show that C(L)C(L) is isomorphic to a hyperbolic right-angled reflection group if and only if LL can be realized as an acute triangulation. The proof relies on the theory of CAT(-1) spaces. A corollary is that an …

2013-06-25abs ↗pdf ↗

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 ↗

New triangulations show harder skeletons for hyperbolic orbifolds.

problem Embedding tricky skeletons of hyperbolic orbifolds in Euclidean space.
method Generalized Gromov-Guth inequality for hyperbolic n-orbifolds, finding nearly optimal geodesic triangulations.
result Triangulations of skeletons become increasingly difficult to embed nicely in Euclidean space.

A polynomial invariant for veering triangulations helps in understanding 3-manifold fibers.

problem Understanding the fibers of 3-manifolds using veering triangulations.
method Introducing a polynomial invariant VτV_τ associated to veering triangulations and using flow graphs.
result The invariant VτV_τ recovers the Teichmüller polynomial for fibered faces and determines cones in homology.

This paper uses the technology of weighted and regular triangulations to study discrete versions of the Laplacian on piecewise Euclidean manifolds. Regular triangulations are studied in some detail, including flip algorithms. The Laplacian is then studied as an operator on functions of the vertices as a generalized wei…

2005-08-10abs ↗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.

If a (cusped) surface S admits an ideal triangulation T with no shears, we show an efficient algorithm to give S as a quotient of hypebolic plane by a subgroup of PSL(2, Z). The algorithm runs in time O(n log n), where n is the number of triangles in the triangulation T. The algorithm generalizes to producing fundament…

2005-10-27abs ↗pdf ↗

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 ↗

We present the mathematical background of a software package that computes triangulations of mapping tori of surface homeomorphisms, suitable for Jeff Weeks's program SnapPea. It consists of two programs. jmt computes triangulations and prints them in a human-readable format. jsnap converts this format into SnapPea's t…

2000-12-01abs ↗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.

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 ↗

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 ↗