English
Related papers

Related papers: A Quantitative Steinitz Theorem for Plane Triangul…

200 papers

We develop a Morse-Lusternik-Schnirelmann theory for the distance between two points of a smoothly embedded circle in a complete Riemannian manifold. This theory suggests very naturally a definition of width that generalises the classical…

Differential Geometry · Mathematics 2025-03-27 Lucas Ambrozio , Rafael Montezuma , Roney Santos

Given an odd representation of the absolute Galois group of Q onto PGL(2,3) and a positive integer N, there exists a twisted modular curve defined over Q whose rational points classify the quadratic Q-curves of degree N realizing the…

Number Theory · Mathematics 2007-05-23 Julio Fernandez , Josep Gonzalez , Joan-C. Lario

We show that, for every n and every surface $\Sigma$, there is a graph U embeddable on $\Sigma$ with at most cn^2 vertices that contains as minor every graph embeddable on $\Sigma$ with n vertices. The constant c depends polynomially on the…

Discrete Mathematics · Computer Science 2023-05-12 Cyril Gavoille , Claire Hilaire

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

Combinatorics · Mathematics 2023-11-10 Steven Simon , Tobias Timofeyev

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

Discrete Mathematics · Computer Science 2010-01-03 Micha Sharir , Adam Sheffer

We prove a conjecture of Benjamini and Curien stating that the local limits of uniform random triangulations whose genus is proportional to the number of faces are the Planar Stochastic Hyperbolic Triangulations (PSHT) defined in…

Probability · Mathematics 2023-07-19 Thomas Budzinski , Baptiste Louf

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

The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…

Rings and Algebras · Mathematics 2018-03-21 Zachary Mesyan

For each $1\leq n\leq6$ we present formulas for the number of $n-$nodal curves in an $n-$dimensional linear system on a smooth, projective surface. This yields in particular the numbers of rational curves in the system of hyperplane…

alg-geom · Mathematics 2008-02-03 Israel Vainsencher

Let D = {D_{1},...,D_{l}} be an arrangement of smooth hypersurfaces with normal crossings on the complex projective space P^n and let \Omega^{1}_{P^n}(log D) be the logarithmic bundle attached to it. Following [1], we show that…

Algebraic Geometry · Mathematics 2015-06-08 Elena Angelini

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…

Geometric Topology · Mathematics 2011-03-04 Felix Effenberger

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…

Geometric Topology · Mathematics 2008-06-16 Jeremy Kahn , Vladimir Markovic

We describe, for various degenerations $S\to \Delta$ of quartic $K3$ surfaces over the complex unit disk (e.g., to the union of four general planes, and to a general Kummer surface), the limits as $t\in \Delta^*$ tends to 0 of the Severi…

Algebraic Geometry · Mathematics 2014-06-03 Ciro Ciliberto , Thomas Dedieu

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

Geometric Topology · Mathematics 2007-05-23 Simon A. King

Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…

Probability · Mathematics 2014-01-24 Agelos Georgakopoulos

We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to…

Discrete Mathematics · Computer Science 2021-02-17 Vincent Froese , Malte Renken

Given a set of $n$ points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum of Euclidean length of its edges. This incredibly challenging problem has been studied for more than…

Computational Geometry · Computer Science 2017-06-13 Sharath Raghvendra , Mariëtte C. Wessels

We generalize the following result of White: Suppose $N$ is a compact, strictly convex domain in $\RR^3$ with smooth boundary. Let $\Sigma$ be a compact 2-manifold with boundary. Then a generic smooth curve $\Gamma\cong \partial\Sigma$ in…

Differential Geometry · Mathematics 2009-05-18 David Hoffman , Brian White

We use a construction which we call generalized cylinders to give a new proof of the fundamental theorem of hypersurface theory. It has the advantage of being very simple and the result directly extends to semi-Riemannian manifolds and to…

Differential Geometry · Mathematics 2019-01-08 Christian Baer , Paul Gauduchon , Andrei Moroianu

Every three-connected planar graph with n vertices has a drawing on an O(n^2) x O(n^2) grid in which all faces are strictly convex polygons. These drawings are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids. More…

Computational Geometry · Computer Science 2007-05-23 Imre Barany , Guenter Rote