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

Trend · papers per month

113226339452 · Jun 202019922001200920172026
48 results for triangulation complexity

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.

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.

Researchers found a way to measure the complexity of Seifert fibered spaces with boundaries.

problem Measuring the complexity of Seifert fibered spaces with boundaries.
method Relating triangulation complexity to Seifert data and using barycentric subdivision.
result Determined triangulation complexity in terms of Seifert data and showed singular fibres can be made simplicial.

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 ↗

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.

New finding links hyperbolic manifold systolic volume to triangulation complexity.

problem Understanding the relationship between systolic volume and triangulation complexity in hyperbolic manifolds.
method Proof based on Jørgensen and Thurston's theorem of hyperbolic volume.
result Systolic volume of hyperbolic manifolds is related to triangulation complexity.

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.

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.

We find vertex bounds for triangulated manifolds and apply them to 4-manifold complexity.

problem Finding vertex bounds for triangulated manifolds in arbitrary dimensions.
method Analyzing face numbers and proving bounds for triangulations of manifolds.
result We prove tight bounds for odd-dimensional manifolds and conjecture for even dimensions, with applications to 4-manifold complexity.

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 ↗

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 ↗

The paper constructs discrete Hessian and divdiv complexes on triangulations and proves their cohomology isomorphic to continuous versions.

problem Discrete construction of Hessian and divdiv complexes on triangulations.
method Construction of discrete Hessian and divdiv complexes using finite elements and Dirac measures on triangulations.
result The cohomology of the constructed complexes is isomorphic to the continuous de Rham cohomology.

Delaunay has shown that the Delaunay complex of a finite set of points PP of Euclidean space Rm\mathbb{R}^m triangulates the convex hull of PP, provided that PP satisfies a mild genericity property. Voronoi diagrams and Delaunay complexes can be defined for arbitrary Riemannian manifolds. However, Delaunay's generic…

2016-12-09abs ↗pdf ↗

We study the connections between subsurface projections in curve and arc complexes in fibered 3-manifolds and Agol's veering triangulation. The main theme is that large-distance subsurfaces in fibers are associated to large simplicial regions in the veering triangulation, and this correspondence holds uniformly for all…

2016-05-28abs ↗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 ↗

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 ↗

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 ↗

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.

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of combinatorial structures of irreducible triangulations is made by hand for the on…

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

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 ↗

It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two triangulations of the 3-dimensional projective space, in terms of the number of tetrahedra.

2002-05-31abs ↗pdf ↗

A triangulation of a 33-manifold can be shown to be homeomorphic to the 33-sphere by describing a discrete Morse function on it with only two critical faces, that is, a sequence of elementary collapses from the triangulation with one tetrahedron removed down to a single vertex. Unfortunately, deciding whether such a …

2015-09-25abs ↗pdf ↗

We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of coefficients, describe this complex explicitly in terms of "tagged triangulations" of the…

2006-08-15abs ↗pdf ↗

For a field F\mathbb{F}, the notion of F\mathbb{F}-tightness of simplicial complexes was introduced by Kühnel. Kühnel and Lutz conjectured that any F\mathbb{F}-tight triangulation of a closed manifold is the most economic of all possible triangulations of the manifold. The boundary of a triangle is the only $\mathbb…

2016-01-01abs ↗pdf ↗

Collapsibility is a combinatorial strengthening of contractibility. We relate this property to metric geometry by proving the collapsibility of any complex that is CAT(0) with a metric for which all vertex stars are convex. This strengthens and generalizes a result by Crowley. Further consequences of our work are: (1) …

2011-07-28abs ↗pdf ↗

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.

In this paper we prove that every definable set has a definable triangulation which is locally Lipschitz and weakly bi-Lipschitz on the natural simplicial stratification of the simplicial complex. We also distinguish a class T of regularity conditions and give a universal construction of a definable triangulation with …

2009-04-08abs ↗pdf ↗

We give an explicit construction of vertex-transitive tight triangulations of dd-manifolds for d2d\geq 2. More explicitly, for each d2d\geq 2, we construct two (d2+5d+5)(d^2+5d+5)-vertex neighborly triangulated dd-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated …

2012-10-03abs ↗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 ↗

We give three constructions of a vertex-minimal triangulation of 44-dimensional real projective space RP4\mathbb{R}P^4. The first construction describes a 44-dimensional sphere on 3232 vertices, which is a double cover of a triangulated RP4\mathbb{R}P^4 and has a large amount of symmetry. The second and third construct…

2014-09-22abs ↗pdf ↗