English
Related papers

Related papers: Orienting triangulations

200 papers

We show that a strongly irreducible and boundary-strongly irreducible surface can be isotoped to be almost normal in a triangulated 3-manifold.

Geometric Topology · Mathematics 2013-02-14 David Bachman , Ryan Derby-Talbot , Eric Sedgwick

We provide a new formulation and proof of the triangle altitudes theorem in hyperbolic plane geometry, together with an easily computed discriminant to distinguish between different basic configurations of the altitudes of such a triangle.

History and Overview · Mathematics 2019-12-30 Nicholas Phat Nguyen

A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…

Dynamical Systems · Mathematics 2026-03-26 David Kurniadi Angdinata , Evan Chen , Ken Ono , Jiaxin Zhang , Jujian Zhang

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

Combinatorics · Mathematics 2025-07-10 Jinjin Liang , Yixi Liao , Wenchuan Hu , Erxiao Wang

Starting with any nondegenerate triangle we can use a well defined interior point of the triangle to subdivide it into six smaller triangles. We can repeat this process with each new triangle, and continue doing so over and over. We show…

Combinatorics · Mathematics 2010-07-15 Steve Butler , Ron Graham

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

Computational Geometry · Computer Science 2010-07-22 Oswin Aichholzer , Franz Aurenhammer , Erik D. Demaine , Ferran Hurtado , Pedro Ramos , Jorge Urrutia

We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…

Geometric Topology · Mathematics 2025-09-30 Daniel V. Mathews , Orion Zymaris

We prove that every triangulation of either of the torus, projective plane and Klein bottle, contains a vertex-spanning planar Laman graph as a subcomplex. Invoking a result of Kir{\'a}ly, we conclude that every $1$-skeleton of a…

Combinatorics · Mathematics 2022-05-03 Eran Nevo , Simion Tarabykin

Let $S$ be a surface of nonpositive curvature of genus bigger than 1 (i.e. not the torus). We prove that any flat strip in the surface is in fact a flat cylinder. Moreover we prove that the number of homotopy classes of such flat cylinders…

Dynamical Systems · Mathematics 2007-05-23 Federico Rodriguez Hertz

We prove that any smooth rational projective surface over the field of complex numbers has an open covering consisting of 3 subsets isomorphic to affine planes.

Algebraic Geometry · Mathematics 2022-03-23 Jorge Caravantes , J. Rafael Sendra , David Sevilla , Carlos Villarino

Every noncompact surface is shown to have a (3,6)-tight triangulation, and applications are given to the generic rigidity of countable bar-joint frameworks in R^3. In particular, every noncompact surface has a (3,6)-tight triangulation that…

Combinatorics · Mathematics 2025-04-08 Stephen C. Power

A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus,…

Geometric Topology · Mathematics 2014-10-01 Colin Adams , Thomas Kindred

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…

Geometric Topology · Mathematics 2007-06-06 Daryl Cooper , Stephan Tillmann

We prove that the pure braid groups on closed, orientable surfaces are bi-orderable, and that the pure braid groups on closed, non-orientable surfaces have generalized torsion, thus they are not bi-orderable.

Geometric Topology · Mathematics 2007-05-23 Juan Gonzalez-Meneses

We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.

Computational Geometry · Computer Science 2013-10-18 Mirela Damian , Erik Demaine , Robin Flatland

A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…

Geometric Topology · Mathematics 2018-06-13 Philip Engel , Peter Smillie

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

Geometric Topology · Mathematics 2013-03-28 David Bachman

Associated to an embedded surface in the $3$-sphere, we construct a diagram of fundamental groups, and prove that it is a complete invariant, wherefrom we deduce complete invariants of handlebody links, tunnels of handlebody links, and…

Geometric Topology · Mathematics 2021-03-09 Giovanni Bellettini , Maurizio Paolini , Yi-Sheng Wang

Recently, a tree bijection has been found for planar hyperbolic surfaces, which allows for an easy computation of the Weil--Petersson volumes, and opens the path to get distance statistic on random hyperbolic surfaces and to find scaling…

Geometric Topology · Mathematics 2025-12-12 Bart Zonneveld

We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…

Combinatorics · Mathematics 2009-06-18 Olivier Bernardi