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

66132197263 · Jun 202019922001200920172026
48 results for minimal triangulation

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.

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 ↗

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.

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 ↗

Previous work of the authors studies minimal triangulations of closed 3-manifolds using a characterisation of low degree edges, embedded layered solid torus subcomplexes and 1-dimensional Z2\mathbb{Z}_2-cohomology. The underlying blueprint is now used in the study of minimal ideal triangulations. As an application, it …

2018-08-08abs ↗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 ↗

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.

In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented 3-manifold the number of vertices for minimal contact triangulations for overtwisted …

2016-08-12abs ↗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.

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 ↗

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.

In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical constructions to take connected sums of triangulated 3-manifolds, we obtain the following re…

2003-07-22abs ↗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 ↗

Starting with an ideal triangulation of the interior of a compact 3-manifold M with boundary, no component of which is a 2-sphere, we provide a construction, called an inflation of the ideal triangulation, to obtain a strongly related triangulations of M itself. Besides a step-by-step algorithm for such a construction,…

2013-02-27abs ↗pdf ↗

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.

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 of spheres map almost linearly to boundaries of high-dimensional polytopes.

problem Finding the minimum number of vertices for triangulations of spheres that map to high-dimensional boundaries.
method Analyzing triangulations of nn-spheres and their maps to boundaries of (n+1)(n+1)-simplexes, focusing on h=n+12floorh=\lfloor\frac{n+1}2 floor.
result The function λ(n,d)hλ(n,d)^h is almost linear in dd as dod o\infty.

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the co…

2003-07-30abs ↗pdf ↗

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

We found a class of triangulated surfaces in Euclidean space which have similar properties as isothermic surfaces in Differential Geometry. We call a surface isothermic if it admits an infinitesimal isometric deformation preserving the mean curvature integrand locally. We show that this class is Möbius invariant. Isoth…

2015-01-12abs ↗pdf ↗

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 ↗

For integers d2d \geq 2 and ε=0ε= 0 or 1, let S1,d1(ε)S^{1, d - 1}(ε) denote the sphere product S1×Sd1S^{1} \times S^{d - 1} if ε=0ε= 0 and the twisted Sd1S^{d - 1} bundle over S1S^{1} if ε=1ε= 1. The main results of this paper are: (a) if dεd \equiv ε (mod 2) then S1,d1(ε)S^{1, d - 1}(ε) has a unique minimal triangulation using 2d+32d + 3

2006-10-27abs ↗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 ↗

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 ↗

Minimal maps from surfaces to torus found for various genus values.

problem Finding minimal degree maps from genus gg surfaces to the torus.
method Constructing simplicial degree dd maps from a triangulation of a genus gg surface to the 7-vertex triangulation of the torus.
result Minimal maps exist for g1g \geq 1 and d2g1|d| \geq 2g - 1 for g3g \geq 3.

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 ↗

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 ↗

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 ↗

In this paper we describe a procedure for refining the given triangulation of a 3-manifold that scales the PL-metric according to a given weight function while creating no new normal surfaces. It is known that an incompressible surface FF in a triangulated 3-manifold MM is isotopic to a normal surface that is of mini…

2008-10-01abs ↗pdf ↗

We show that in any triangulated 3-manifold, every index n topologically minimal surface can be transformed to a surface which has local indices (as computed in each tetrahedron) that sum to at most n. This generalizes classical theorems of Kneser and Haken, and more recent theorems of Rubinstein and Stocking, and is t…

2012-10-16abs ↗pdf ↗

A triangulated dd-manifold KK, satisfies the inequality (f0(K)d12)(d+22)β1(K;Z2)\binom{f_0(K)-d-1}{2}\geq \binom{d+2}{2}β_1(K;\mathbb{Z}_2) for d3d\geq 3. The triangulated dd-manifolds that meet the bound with equality are called {\em tight neighborly}. In this paper, we present tight neighborly triangulations of 4-manifolds on 15 vertic…

2013-06-24abs ↗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 ↗

We establish combinatorial versions of various classical systolic inequalities. For a smooth triangulation of a closed smooth manifold, the minimal number of edges in a homotopically non-trivial loop contained in the 11-skeleton gives an integer called the combinatorial systole. The number of top-dimensional simplices…

2015-06-23abs ↗pdf ↗