arXiv research

Bounding shears in ideal triangulations on hyperbolic surfaces.

New method to parametrize infinite Riemann surfaces with bounded triangulations.

Minimal Delaunay triangulations on hyperbolic surfaces have linear number of vertices.

Triangulates surfaces with bounded energy using diffeomorphisms.

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

We show that any two geometric triangulations of a closed hyperbolic, spherical or Euclidean manifold are related by a sequence of Pachner moves and barycentric subdivisions of bounded length. This bound is in terms of the dimension of the manifold, the number of top dimensional simplexes and bound on the lengths of ed…

New bounds show triangulated surfaces are evenly distributed in moduli space.

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…

We prove that the number of combinatorially distinct causal 3-dimensional triangulations homeomorphic to the 3-dimensional sphere is bounded by an exponential function of the number of tetrahedra. It is also proven that the number of combinatorially distinct causal 4-dimensional triangulations homeomorphic to the 4-sph…

Efficient triangulations help in understanding 3-manifold boundaries.

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…

The paper bounds distances and transformations between pants decompositions and triangulations on surfaces.

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

We survey basic properties and bounds for $q$-equivelar and $d$-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for $q$-equivelar and $d$-covered triangulations. We identify all orientable and non-orientable surfaces $M$ of Euler characteristic $0>χ(M)\geq -230$ which ad…

Paper finds infinite family of minimal triangulations for complex 3D shapes.

Based on the work of Durhuus-J{ó}nsson and Benedetti-Ziegler, we revisit the question of the number of triangulations of the 3-ball. We introduce a notion of nucleus (a triangulation of the 3-ball without internal nodes, and with each internal face having at most 1 external edge). We show that every triangulation can b…

Smooth manifolds can be triangulated with graphs of bounded twin-width.

Researchers found the minimum number of tetrahedra needed to triangulate 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…

The paper bounds Pachner moves and systoles in hyperbolic 3-manifolds.

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 $n$ and $d$, construction of $n$…

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal triangulations.

This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface or triangulation. Two applications of these bounds are given. First, the minima…

Agol recently introduced the notion of a veering triangulation, and showed that such triangulations naturally arise as layered triangulations of fibered hyperbolic 3-manifolds. We prove, by a constructive argument, that every veering triangulation admits positive angle structures, recovering a result of Hodgson, Rubins…

Minimal triangulations for 229 hyperbolic census knots discovered.

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 + \frac{(n + 1)^2}{2}$ for $n \geq 3$. We give explicit construction of so…

Improved lower bounds on 2-bridge link complexity.

It is not known whether there exists a computable function bounding the number of Pachner moves needed to connect any two triangulation of a compact 3-manifold. In this paper we find an explicit bound of this kind for all Haken 3-manifolds which contain no fibred submanifolds as strongly simple pieces of their JSJ-deco…

In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup's generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem…

Let $T$ be a triangulation of a Riemann surface. We show that the 1-skeleton of $T$ may be oriented so that there is a global bound on the outdegree of the vertices. Our application is to construct extremal metrics on triangulations formed from $T$ by attaching new edges and vertices and subdividing its faces. Such ref…

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 …

We construct a new infinite family of ideal triangulations and H-triangulations for the complements of twist knots, using a method originating from Thurston. These triangulations provide a new upper bound for the Matveev complexity of twist knot complements. We then prove that these ideal triangulations are geometric. …

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.

We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary curve and $n$ marked points on this curve; we consider triangulations up to homeomor…

Software simplifies triangulations of 4-manifolds, revealing exotic structures.

A triangulation of a compact 3-manifold is annular-efficient if it is 0-efficient and the only normal, incompressible annuli are thin edge-linking. If a compact 3-manifold has an annular-efficient triangulation, then it is irreducible, boundary-irreducible, and an-annular. Conversely, it is shown that for a compact, ir…

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

A triangulated $d$-manifold $K$, satisfies the inequality $\binom{f_0(K)-d-1}{2}\geq \binom{d+2}{2}β_1(K;\mathbb{Z}_2)$ for $d\geq 3$. The triangulated $d$-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…

It is not completely unreasonable to expect that a computable function bounding the number of Pachner moves needed to change any triangulation of a given 3-manifold into any other triangulation of the same 3-manifold exists. In this paper we describe a procedure yielding an explicit formula for such a function if the 3…

Algorithm constructs triangulations for Heegaard splittings and related 3-manifolds.

We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our algorithm takes $O(g^2+gn)$ time to obtain $T^\prime$, where $n$ is the number o…

Plane triangulations remain rigid under discrete conformal changes.

We introduce a numerical isomorphism invariant p(T) for any triangulation T of S^3. Although its definition is purely topological (inspired by the bridge number of knots), p(T) reflects the geometric properties of T. Specifically, if T is polytopal or shellable then p(T) is `small' in the sense that we obtain a linear …

New proof shows efficient ReLU networks for piecewise linear functions.

We study a variation of Bagchi and Datta's $σ$-vector of a simplicial complex $C$, whose entries are defined as weighted averages of Betti numbers of induced subcomplexes of $C$. We show that these invariants satisfy an Alexander-Dehn-Sommerville type identity, and behave nicely under natural operations on triangulated…

It is shown that given any link-manifold, there is an algorithm to decide if the manifold contains an embedded, essential planar surface; if it does, the algorithm will construct one. If a slope on the boundary of the link-manifold is given, there is an algorithm to determine if the slope bounds an embedded punctured-d…

Recognition of Seifert fibered spaces with boundary is computationally tractable.

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number of such surfaces grows in relation to the size of the underlying triangulation.…