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

83166248331 · Jun 202019922001200920172026
48 results for ordered triangulations

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.

We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve.

2016-04-14abs ↗pdf ↗

New triangulations of octonionic projective plane found with restricted symmetry groups.

problem Finding symmetry groups of 27-vertex triangulations of manifolds like the octonionic projective plane.
method Using Smith and Bredon's results on transformation groups to restrict possible symmetry groups.
result List of 26 subgroups of S27 containing all possible symmetry groups of 27-vertex triangulations of manifolds like the octonionic project plane.

Study simplicial volume of manifolds from reflection group trick.

problem Characterize manifolds with positive simplicial volume.
method Define a partial order on triangulations and solve explicitly for minimal elements.
result Explicitly solved triangulations of the two-dimensional sphere and performed extensive analysis for three-dimensional case.

In graph theory, Courcelle's theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved in linear time for graphs of bounded treewidth. We prove such a metatheorem for a general class of triangulations of arbitrary fixed dimension d, including all t…

2014-03-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.

634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations of octonionic projective plane.

problem Constructing and classifying triangulations of the octonionic projective plane.
method Combinatorial construction and analysis of symmetry groups.
result Found 634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations.

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.

Any hyperbolic surface bundle over the circle gives rise to a continuous surjection from the circle to the sphere, by work of Cannon and Thurston. We prove that the order in which this surjection fills out the sphere is dictated by a natural triangulation of the surface bundle (introduced by Agol) when all singularitie…

2015-06-10abs ↗pdf ↗

New stability conditions identified from quadratic differentials on surfaces.

problem Identifying stability conditions from quadratic differentials.
method Comparison of exchange graphs from tilting hearts and flipping mixed angulations.
result Spaces of stability conditions identified with moduli spaces of quadratic differentials.

This paper is the third in a sequence establishing a dictionary between the combinatorics of veering triangulations equipped with appropriate filling slopes, and the dynamics of pseudo-Anosov flows (without perfect fits) on closed three-manifolds. Our motivation comes from the work of Agol and Guéritaud. Agol introduce…

2019-10-31abs ↗pdf ↗

Let M be a complete finite-volume hyperbolic 3-manifold with compact non-empty geodesic boundary and k toric cusps, and let T be a geometric partially truncated triangulation of M. We show that the variety of solutions of consistency equations for T is a smooth manifold or real dimension 2k near the point representing …

2005-04-06abs ↗pdf ↗

Connected domination numbers found for plane triangulations up to 13 vertices.

problem Finding connected domination numbers for plane triangulations.
method Analyzing triangulations of up to 13 vertices and proving the difference between connected and regular domination numbers can be arbitrarily large.
result Connected domination numbers for triangulations up to 13 vertices and upper bound for larger triangulations.

The braid group of a complex reflection group is shown to be an index d subgroup.

problem Understanding the structure of braid groups associated with complex reflection groups.
method Presented a compatible presentation for the braid group of the orbifold quotient and a tagged triangulation of the disk.
result The braid group of the complex reflection group G(d,d,n)G(d,d,n) is an index dd subgroup of the braid group of the orbifold quotient.

We introduce the discrete Einstein metrics as critical points of discrete energy on triangulated 3-manifolds, and study them by discrete curvature flow of second (fourth) order. We also study the convergence of the discrete curvature flow. Discrete curvature flow of second order is an analogue of smooth Ricci flow.

2013-12-03abs ↗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 ↗

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.

We extend average edge order results to normal 3-pseudomanifolds.

problem Determining the average edge order of normal 3-pseudomanifolds.
method Extending previous results on 3-manifolds to 3-pseudomanifolds with singularities.
result For a normal 3-pseudomanifold KK, μ0(K)307μ_0(K) \geq \frac{30}{7}, with equality if and only if KK is a specific triangulation of RP2\mathbb{RP}^2.

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 ↗