English
Related papers

Related papers: Irreducible Triangulations are Small

200 papers

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

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…

Geometric Topology · Mathematics 2007-05-23 Feng Luo , Saul Schleimer , Stephan Tillmann

Given two pants decompositions of a compact orientable surface $S$, we give an upper bound for their distance in the pants graph that depends logarithmically on their intersection number and polynomially on the Euler characteristic of $S$.…

Geometric Topology · Mathematics 2025-11-06 Marc Lackenby , Mehdi Yazdi

A simple graph is $3$-rigid if its generic bar-joint frameworks in $R^3$ are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal $3$-rigidity of a simple graph which is obtained from the $1$-skeleton of a…

Combinatorics · Mathematics 2015-09-03 James Cruickshank , Derek Kitson , Stephen Power

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

An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least…

Combinatorics · Mathematics 2024-11-27 Darryn Bryant , Peter Dukes , Daniel Horsley , Barbara Maenhaut , Richard Montgomery

This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…

Combinatorics · Mathematics 2008-02-07 Eric Fusy

We prove that in the complement of a highly twisted link, all closed, essential, meridionally incompressible surfaces must have high genus. The genus bound is proportional to the number of crossings per twist region. A similar result holds…

Geometric Topology · Mathematics 2015-06-24 Ryan Blair , David Futer , Maggy Tomova

We consider a rational surface with a relatively minimal fibration. Picard number of a such fibred surface is bounded in terms of the genus of a general fibre. When Picard number is the maximum for any given genus, we characterize a such…

Algebraic Geometry · Mathematics 2010-06-28 Shinya Kitagawa

We determine the possible intersection sizes of a Hermitian surface $\mathcal H$ with an irreducible quadric of ${\mathrm PG}(3,q^2)$ sharing at least a tangent plane at a common non-singular point when $q$ is even.

Combinatorics · Mathematics 2016-11-01 Angela Aguglia , Luca Giuzzi

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

Algebraic Geometry · Mathematics 2020-06-09 Alain Couvreur , Philippe Lebacque , Marc Perret

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

Combinatorics · Mathematics 2017-07-19 Tyler Seacrest , Francis Edward Su

An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. Carvalho, Lucchesi, and Murty showed that every brick $G$ different from $K_4$ and $\overline{C_6}$ has at least $\Delta-2$ removable edges, where…

Combinatorics · Mathematics 2024-08-07 Deyu Wu , Yipei Zhang , Xiumei Wang

In this article, we give a new upper bound for the regularity of edge ideals of gap-free graphs, in terms of the their minimal triangulation. Let $H_U=G\cup F_U$ be a minimal triangulation of a gap-free graph $G$, for some maximal…

Combinatorics · Mathematics 2021-09-13 Rimpa Nandi , Ramakrishna Nanduri

We show that a 3-manifold containing an incompressible surface has topologically minimal surfaces of arbitrary high genus.

Geometric Topology · Mathematics 2013-01-22 Jung Hoon Lee

0-efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation or M can be shown to be one of the…

Geometric Topology · Mathematics 2007-05-23 William Jaco , J. Hyam Rubinstein

We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…

Combinatorics · Mathematics 2021-07-09 James Cruickshank , Eleftherios Kastis , Derek Kitson , Bernd Schulze

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…

Combinatorics · Mathematics 2013-04-30 Jesús A. De Loera , Francisco Santos , Fumihiko Takeuchi

Let $S$ be a minimal surface of general type with irregularity $q(S) = 1$. Well-known inequalities between characteristic numbers imply that $3 p_g(S) \le c_2(S) \le 10 p_g(S)$, where $p_g(S)$ is the geometric genus and $c_2(S)$ the…

Algebraic Geometry · Mathematics 2018-04-23 Matthew Stover

We construct a complete, embedded minimal surface in euclidean 3-space which has unbounded Gaussian curvature. It has infinite genus, infinitely many catenoidal type ends and one limit end.

Differential Geometry · Mathematics 2010-06-18 Martin Traizet
‹ Prev 1 4 5 6 7 8 10 Next ›