English
Related papers

Related papers: Degree-regular triangulations of surfaces

200 papers

A $d$-angulation is a planar map with faces of degree $d$. We present for each integer $d\geq 3$ a bijection between the class of $d$-angulations of girth $d$ (i.e., with no cycle of length less than $d$) and a class of decorated plane…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

A set of control points can determine a Bezier surface and a triangulated surface simultaneously. We prove that the triangulated surface becomes homeomorphic and ambient isotopic to the Bezier surface via subdivision. We also show that the…

Differential Geometry · Mathematics 2013-11-22 J. Li

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

The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.

Combinatorics · Mathematics 2016-11-25 Jorge Arocha , Javier Bracho , Natalia García-Colín , Isabel Hubard

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

The degree of a map between orientable manifolds is a fundamental concept in topology, offering deep insights into the structure of the manifolds and the nature of the corresponding maps. This concept has been extensively studied,…

Combinatorics · Mathematics 2026-01-07 Biplab Basak , Ayushi Trivedi

A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…

Combinatorics · Mathematics 2015-02-18 Guenter Rote , Francisco Santos , Ileana Streinu

We prove that any compact surface with constant positive curvature and conical singularities can be decomposed into irreducible components of standard shape, glued along geodesic arcs connecting conical singularities. This is a spherical…

Geometric Topology · Mathematics 2022-01-05 Guillaume Tahar

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

Algebraic Geometry · Mathematics 2007-05-23 Stephan Endraß , Ulf Persson , Jan Stevens

Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

We classify rotational surfaces in a normed 3-space with rotationally symmetric norm whose principal curvatures satisfy a linear relation.

Differential Geometry · Mathematics 2024-03-05 Makoto Sakaki , Kakeru Yanase

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

Combinatorics · Mathematics 2025-05-23 Wen Chen , Jinjin Liang , Erxiao Wang

We prove that if a complete Riemannian surface $(\Sigma,d_\Sigma)$ is quasi-isometric to some bounded degree graph $G$, then $\Sigma$ admits a triangulation whose 1-skeleton is quasi-isometric to it when equipped with the simplicial metric.…

Metric Geometry · Mathematics 2026-05-19 Agelos Georgakopoulos , Federico Vigolo

We study surfaces in $\R^4$ whose tangent spaces have constant principal angles with respect to a plane. Using a PDE we prove the existence of surfaces with arbitrary constant principal angles. The existence of such surfaces turns out to be…

Differential Geometry · Mathematics 2011-05-11 Pierre Bayard , Antonio J. Di Scala , Osvaldo Osuna-Castro , Gabriel Ruiz-Hernandez

An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for…

Differential Geometry · Mathematics 2014-12-18 Ognian Kassabov

The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…

Combinatorics · Mathematics 2026-05-15 Kamillo Ferry , Michael Joswig , Jörg Rambau

We determine some of the derived equivalences of a class of gentle algebras called surface algebras. These algebras are constructed from an unpunctured Riemann surface of genus 0 with boundary and marked points by introducing cuts in…

Representation Theory · Mathematics 2012-06-13 Lucas David-Roesler

We prove that a reduced and irreducible algebraic surface in $\mathbb{CP}^{3}$ containing infinitely many twistor lines cannot have odd degree. Then, exploiting the theory of quaternionic slice regularity and the normalization map of a…

Differential Geometry · Mathematics 2021-12-22 Amedeo Altavilla , Edoardo Ballico

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…

Combinatorics · Mathematics 2015-11-23 Ivan Izmestiev