SearcharxivSearch

arXiv subjects

Hugo Parlier

Publications and source records attributed to Hugo Parlier.

At least 55 records · Page 3Linked to original sources

The maximum number of systoles for genus two Riemann surfaces with abelian differentials

In this article, we provide bounds on systoles associated to a holomorphic $1$-form $ω$ on a Riemann surface $X$. In particular, we show that if $X$ has genus two, then, up to homotopy, there are at most $10$ systolic loops on $(X,ω)$ and, moreover, that this bound is realized by a unique translation surface up to homothety. For general genus $g$ and a holomorphic 1-form $ω$ with one zero, we provide the optimal upper bound, $6g-3$, on the number of homotopy classes of systoles. If, in addition, $X$ is hyperelliptic, then we prove that the optimal upper bound is $6g-5$.

math.GT

Geometric simplicial embeddings of arc-type graphs

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and topology. We show a number of rigidity results, namely showing that, under certain complexity conditions, that simplicial maps between them only arise in the "obvious way". We also observe that, again under necessary complexity conditions, subsurface strata are convex. Put together, these results imply that certain simplicial maps always give rise to convex images.

math.GT

Minimal length product over homology bases of manifolds

Minkowski's second theorem can be stated as an inequality for $n$-dimensional flat Finsler tori relating the volume and the minimal product of the lengths of closed geodesics which form a homology basis. In this paper we show how this fundamental result can be promoted to a principle holding for a larger class of Finsler manifolds. This includes manifolds for which first Betti number and dimension do no necessarily coincide, a prime example being the case of surfaces. This class of manifolds is described by a non-vanishing condition for the hyperdeterminant reduced modulo $2$ of the multilinear map induced by the fundamental class of the manifold on its first ${\mathbb Z}_2$-cohomology group using the cup product.

math.GT

Quantifying the sparseness of simple geodesics on hyperbolic surfaces

The goal of the article is to provide different explicit quantifications of the non density of simple closed geodesics on hyperbolic surfaces. In particular, we show that within any embedded metric disk on a surface, lies a disk of radius only depending on the topology of the surface (and the size of the first embedded disk), which is disjoint from any simple closed geodesic.

math.GT

Delaunay Triangulations of Points on Circles

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but since it is not a generic situation, this difficulty is usually handled by using a (symbolic or explicit) perturbation. As an alternative, we propose to define a canonical triangulation for a set of concyclic points by using a max-min angle characterization of Delaunay triangulations. This point of view leads to a well defined and unique triangulation as long as there are no symmetric quadruples of points. This unique triangulation can be computed in quasi-linear time by a very simple algorithm.

cs.CG

Chromatic numbers for the hyperbolic plane and discrete analogs

We study colorings of the hyperbolic plane, analogously to the Hadwiger-Nelson problem for the Euclidean plane. The idea is to color points using the minimum number of colors such that no two points at distance exactly $d$ are of the same color. The problem depends on $d$ and, following a strategy of Kloeckner, we show linear upper bounds on the necessary number of colors. In parallel, we study the same problem on $q$-regular trees and show analogous results. For both settings, we also consider a variant which consists in replacing $d$ with an interval of distances.

math.CO

Counting curves, and the stable length of currents

Let $γ_0$ be a curve on a surface $Σ$ of genus $g$ and with $r$ boundary components and let $π_1(Σ)\curvearrowright X$ be a discrete and cocompact action on some metric space. We study the asymptotic behavior of the number of curves $γ$ of type $γ_0$ with translation length at most $L$ on $X$. For example, as an application, we derive that for any finite generating set $S$ of $π_1(Σ)$ the limit $$\lim_{L\to\infty}\frac 1{L^{6g-6+2r}}\{γ\text{ of type }γ_0\text{ with }S\text{-translation length}\le L\}$$ exists and is positive. The main new technical tool is that the function which associates to each curve its stable length with respect to the action on $X$ extends to a (unique) continuous and homogenous function on the space of currents. We prove that this is indeed the case for any action of a torsion free hyperbolic group.

math.GT

Interrogating surface length spectra and quantifying isospectrality

This article is about inverse spectral problems for hyperbolic surfaces and in particular how length spectra relate to the geometry of the underlying surface. A quantitative answer is given to the following: how many questions do you need to ask a length spectrum to determine it completely? In answering this, a quantitative upper bound is given on the number of isospectral but non-isometric surfaces of a given genus.

math.DG

Geometric filling curves on surfaces

This note is about a type of quantitative density of closed geodesics on closed hyperbolic surfaces. The main results are upper bounds on the length of the shortest closed geodesic that $\varepsilon$-fills the surface.

math.GT

Short closed geodesics with self-intersections

Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer $k$, we are interested in the set of all closed geodesics with at least $k$ (but possibly more) self-intersections. Among these, we consider those of minimal length and investigate their self-intersection numbers. We prove that their intersection numbers are upper bounded by a universal linear function in $k$ (which holds for any hyperbolic surface). Moreover, in the presence of cusps, we get bounds which imply that the self-intersection numbers behave asymptotically like $k$ for growing $k$.

math.GT

Distances in domino flip graphs

This article is about measuring and visualizing distances between domino tilings. Given two tilings of a simply connected square tiled surface, we're interested in the minimum number of flips between two tilings. Given a certain shape, we're interested in computing the diameters of the flip graphs, meaning the maximal distance between any two of its tilings. Building on work of Thurston and others, we give geometric interpretations of distances which result in formulas for the diameters of the flip graphs of rectangles or Aztec diamonds.

math.CO

Once punctured disks, non-convex polygons, and pointihedra

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of polygons with a marked point as embedded sub-graphs. Our main focus is on the geometric properties of these graphs and how they relate to one another. In particular, we show that the embeddings between them are strongly convex (or, said otherwise, totally geodesic). We also find bounds on the diameters of these graphs, sometimes using the strongly convex embeddings. Finally, we show how these graphs relate to different polytopes, namely type D associahedra and a family of secondary polytopes which we call pointihedra.

math.CO

Arc and curve graphs for infinite-type surfaces

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite diameter; this extends a recent result of J. Bavard to a large class of punctured surfaces. Second, we study the subgraph of the curve graph spanned by those elements which intersect a fixed separating curve on the surface. We show that this graph has infinite diameter and geometric rank 3, and thus is not hyperbolic.

math.GT

Modular flip-graphs of one holed surfaces

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 homeomorphism with the marked points as their vertices. Our main results are upper and lower bounds on the maximal distance between triangulations depending on $n$ and can be thought of as bounds on the diameter of flip-graphs up to the quotient of underlying homeomorphism groups. The main results assert that the diameter of these quotient graphs grows at least like $5n/2$ for all $g\geq 1$. Our upper bounds grow at most like $[4 -1/(4g)]n$ for $g\geq 2$, and at most like $23n/8 $ for the torus.

math.GT

Systoles and kissing numbers of finite area hyperbolic surfaces

We study the number and the length of systoles on complete finite area orientable hyperbolic surfaces. In particular, we prove upper bounds on the number of systoles that a surface can have (the so-called kissing number for hyperbolic surfaces). Our main result is a bound which only depends on the topology of the surface and which grows subquadratically in the genus.

math.GT

Simultaneous flips on triangulated surfaces

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds on distance between triangulations that only depend on the topology of the surface.

math.GT

The genus of curve, pants and flip graphs

This article is about the graph genus of certain well studied graphs in surface theory: the curve, pants and flip graphs. We study both the genus of these graphs and the genus of their quotients by the mapping class group. The full graphs, except for in some low complexity cases, all have infinite genus. The curve graph once quotiented by the mapping class group has the genus of a complete graph so its genus is well known by a theorem of Ringel and Youngs. For the other two graphs we are able to identify the precise growth rate of the graph genus in terms of the genus of the underlying surface. The lower bounds are shown using probabilistic methods.

math.GT

Filling sets of curves on punctured surfaces

We study filling sets of simple closed curves on punctured surfaces. In particular we study lower bounds on the cardinality of sets of curves that fill and that pairwise intersect at most k times on surfaces with given genus and number of punctures. We are able to establish orders of growth for even k and show that for odd k the orders of growth behave differently. We also study the corresponding questions when one requires that the curves be represented as systoles on hyperbolic complete finite area surfaces.

math.GT