arXiv research

Enhances understanding of stability conditions on surfaces.

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal $\mathbb{Z}_2^2$-equivariant triangulations of $2$-dimensional small covers. We discuss vertex minimal equilibrium triangulations of $\mathbb{R…

3-manifolds have covers with infinitely many ideal triangulations.

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, 2k-1)$ and the generalised quaternionic space $S^3/Q_{4k}$ have complexity $k,…

Extends circle pattern theorem to quasi-simplicial triangulations.

Researchers compute covering type of all closed surfaces.

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…

Tessellations cover planes without gaps or overlaps.

Connected flip graphs for triangulations on hyperbolic surfaces.

Tiny complexes share 3-5 triangles in common coverings.

It is shown that every non-compact hyperbolic manifold of finite volume has a finite cover admitting a geodesic ideal triangulation. Also, every hyperbolic manifold of finite volume with non-empty, totally geodesic boundary has a finite regular cover which has a geodesic partially truncated triangulation. The proofs us…

The Andreev-Thurston theorem states that for any triangulation of a closed orientable surface Σ_g of genus g which is covered by a simple graph in the universal cover, there exists a unique metric of curvature 1, 0 or -1 on the surface depending on whether g=0, 1 or \ge 2 such that the surface with this metric admits a…

A canonical branched covering over each sufficiently good simplicial complex is constructed. Its structure depends on the combinatorial type of the complex. In this way, each closed orientable 3-manifold arises as a branched covering over the 3-sphere from some triangulation of S^3. This result is related to a theorem …

Study on veering triangulations and their flow graphs, proving new applications.

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

With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable surfaces for every $q=3k$, $k\geq 2$, and every $q=3k+1$, $k\geq 3$. Series of cy…

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…

Research shows finiteness in triangulations with girth constraints.

Essential triangulations connect via specific moves in 3-manifolds.

Geodesics count exponentially between triangulations of surfaces with enough topology.

Every open Riemann surface can be triangulated with equilateral triangles.

Study flip graphs for surfaces of infinite type, finding uncountably many connected components.

The paper constructs triangulations for double twist knots using geometric methods.

We prove that any two finite-area non-compact hyperbolic Riemann surfaces S and T have finite covers that are arbitrarily close in the normalized Weil-Petersson metric, where we normalize by dividing the square of the metric by the area of the surface. In the case where T is the modular surface this reduces to showing …

Study braid group actions on exceptional sequences using branched coverings.

Using existing technology, we prove a Masur-Minsky style distance formula for flip- graph distance between two triangulations, expressed as a sum of the distances of the projections of these triangulations into arc graphs of the suitable subsurfaces of S.

The paper finds 3-colorings of 2-sphere triangulations.

To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in …

Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices, via a sequence of 2-3 and 3-2 moves. We can interpret this as showing that the Pa…

Essential triangulations of certain manifolds are connected via specific moves.

Twisted Neumann--Zagier matrices for quantum invariants.

Machine learning identifies 3-manifold triangulations using isomorphism signatures.

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the vertices of platonic solids have to be used. With a coloring monodromy one can asso…

New method finds large counterexamples by selectively exploring triangulations.

This paper connects veering triangulations to pseudo-Anosov flows on 3-manifolds.

New findings on strong convexity in triangulations of convex polygons.

The study connects triangulated surfaces to complex projective structures and circle patterns.

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…

No 3-manifolds have triangulations of bounded treewidth.

A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.

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…

Essential surfaces found in curved 3D shapes.

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 …

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

This paper is concerned with lower bounds for the connectivity of graphs (one-dimensional skeleta) of triangulations of compact manifolds. We introduce a structural invariant b_M for simplicial d-manifolds M taking values in the range 0 <= b_M <= d-1. The main result is that b_M influences connectivity in the following…

Method samples triangulations of manifolds using biased random walks.

The paper finds and visualizes unique geometric polyhedra and tori with few vertices.

Closed geodesics densely cover a circle in dilation surfaces.