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

9192837 · Jun 202619922001200920172026
48 results for triangulated balls

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 describe two methods for showing that a vector can not be the f-vector of a homology d-ball. As a consequence, we disprove a conjectured characterization of the f-vectors of balls of dimension five and higher due to Billera and Lee. We also provide a construction of triangulated balls with various f-vectors. We show…

2009-12-10abs ↗pdf ↗

New flows represent Thurston norm ball faces, differing by veering mutations.

problem Dynamic representation of Thurston norm ball faces by distinct flows.
method Combining veering triangulations and mutations to represent faces by multiple flows.
result Non-fibered faces can be represented by two distinct flows differing by veering mutations.

Developed algorithms to compute three polynomial invariants of veering triangulations.

problem Computing polynomial invariants of veering triangulations.
method Introduced and used algorithms for taut, veering, and Teichmüller polynomials based on upper and lower tracks of veering triangulations.
result Proved that the lower and upper taut polynomials are equal but the veering polynomials can differ.

Solves a triangulation problem by showing minimum tetrahedra equals minimum integral 3-chain.

problem Finding the minimum number of tetrahedra to extend a triangulation of a 2-sphere to a 3-ball.
method Relates the minimum number of tetrahedra to the minimum integral 3-chain norm, proving them equal and showing how to achieve the minimum.
result The minimum number of tetrahedra needed to extend a triangulation of a 2-sphere to a 3-ball equals the minimum integral 3-chain norm.

New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.

problem Understanding the relationship between flip distance and polyhedron triangulation numbers.
method Provided examples to demonstrate the difference between flip distance and polyhedron triangulation numbers.
result Ratio of flip distance to polyhedron triangulation numbers can be arbitrarily close to 3/2.

We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product S2×S1S^2\times S^1 and 615 triangulations of the twisted sphere product $S^2_\times_S^1$. All the 3-spheres…

2006-04-02abs ↗pdf ↗

We construct the first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible. It has only 15 vertices. We exhibit a second 3-ball B_{12,38} with 12 vertices that is collapsible and evasive, but not shellable. Finally, we present the first explicit triangulation of a 3-sphere S_{18, 125} (with only 1…

2013-03-08abs ↗pdf ↗

The taut polynomial equals a twisted Alexander polynomial.

problem Understanding the relationship between taut polynomials and Alexander polynomials.
method Defined taut polynomial of veering triangulations and proved it equals a twisted Alexander polynomial.
result The taut polynomial equals a twisted Alexander polynomial of the underlying manifold.

Let MM be a closed hyperbolic 3-manifold with a fibered face σσ of the unit ball of the Thurston norm on H2(M)H_2(M). If MM satisfies a certain condition related to Agol's veering triangulations, we construct a taut branched surface in MM spanning σσ. This partially answers a 1985 question of Oertel, and extends an e…

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

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.

Mogami introduced in 1995 a large class of triangulated 3-dimensional pseudomanifolds, henceforth called "Mogami pseudomanifolds". He proved an exponential bound for the size of this class in terms of the number of tetrahedra. The question of whether all 3-balls are Mogami has remained open since, a positive answer wou…

2016-08-06abs ↗pdf ↗

We define a 2-normal surface to be one which intersects every 3-simplex of a triangulated 3-manifold in normal triangles and quadrilaterals, with one or two exceptions. The possible exceptions are a pair of octagons, a pair of unknotted tubes, an octagon and a tube, or a 12-gon. In this paper we use the theory of criti…

2003-09-26abs ↗pdf ↗

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by non-negative integer weights, 14 for each 3-simplex, that describe how many copies o…

2007-06-05abs ↗pdf ↗

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is shellable. This complements Mary Ellen Rudin's classical example of a non-shella…

2012-02-29abs ↗pdf ↗

An ideal triangulation T\mathcal{T} of a hyperbolic 3-manifold MM with one cusp is non-peripheral if no edge of T\mathcal{T} is homotopic to a curve in the boundary torus of MM. For such a triangulation, the gluing and completeness equations can be solved to recover the hyperbolic structure of MM. A planar project…

2016-10-31abs ↗pdf ↗

In this paper, we study the geometric aspects of ball packings on (M,T)(M,\mathcal{T}), where T\mathcal{T} is a triangulation on a 3-manifold MM. We introduce a combinatorial Yamabe invariant YTY_{\mathcal{T}}, depending on the topology of MM and the combinatoric of T\mathcal{T}. We prove that YTY_{\mathcal{T}} is att…

2018-05-27abs ↗pdf ↗

A Delaunay decomposition is a cell decomposition in R^d for which each cell is inscribed in a Euclidean ball which is empty of all other vertices. This article introduces a generalization of the Delaunay decomposition in which the Euclidean balls in the empty ball condition are replaced by other families of regions bou…

2016-02-11abs ↗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.

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.

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 ↗