Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

Results 1-13 of 13.
((uid:50026032))
Measuring Pants Doan, Nhat Minh ; Parlier, Hugo ; E-print/Working paper (2020) We investigate the terms arising in an identity for hyperbolic surfaces proved by Luo and Tan, namely showing that they vary monotonically in terms of lengths and that they verify certain convexity ... [more ▼] We investigate the terms arising in an identity for hyperbolic surfaces proved by Luo and Tan, namely showing that they vary monotonically in terms of lengths and that they verify certain convexity properties. Using these properties, we deduce two results. As a first application, we show how to deduce a theorem of Thurston which states, in particular for closed hyperbolic surfaces, that if a simple length spectrum "dominates" another, then in fact the two surfaces are isometric. As a second application, we show how to find upper bounds on the number of pairs of pants of bounded length that only depend on the boundary length and the topology of the surface. [less ▲] Detailed reference viewed: 132 (64 UL)Delaunay Triangulations of Points on Circles ; ; Parlier, Hugo et al E-print/Working paper (2018) 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 ... [more ▼] 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. [less ▲] Detailed reference viewed: 60 (10 UL)The maximum number of systoles for genus two Riemann surfaces with abelian differentials ; Parlier, Hugo E-print/Working paper (2017) This article explores the length and number of systoles associated to holomorphic $1$-forms on surfaces. In particular, we show that up to homotopy, there are at most $10$ systolic loops on such a genus ... [more ▼] This article explores the length and number of systoles associated to holomorphic $1$-forms on surfaces. In particular, we show that up to homotopy, there are at most $10$ systolic loops on such a genus two surface and that the bound is realized by a unique translation surface up to homothety. We also provide sharp upper bounds on the the number of homotopy classes of systoles for a holomorphic $1$-form with a single zero in terms of the genus. [less ▲] Detailed reference viewed: 102 (7 UL)Chromatic numbers for the hyperbolic plane and discrete analogs Parlier, Hugo ; E-print/Working paper (2017) 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 ... [more ▼] 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. [less ▲] Detailed reference viewed: 38 (5 UL)Counting curves, and the stable length of currents ; Parlier, Hugo ; E-print/Working paper (2016) Let $\gamma_0$ be a curve on a surface $\Sigma$ of genus $g$ and with $r$ boundary components and let $\pi_1(\Sigma)\curvearrowright X$ be a discrete and cocompact action on some metric space. We study ... [more ▼] Let $\gamma_0$ be a curve on a surface $\Sigma$ of genus $g$ and with $r$ boundary components and let $\pi_1(\Sigma)\curvearrowright X$ be a discrete and cocompact action on some metric space. We study the asymptotic behavior of the number of curves $\gamma$ of type $\gamma_0$ with translation length at most $L$ on $X$. For example, as an application, we derive that for any finite generating set $S$ of $\pi_1(\Sigma)$ the limit $$\lim_{L\to\infty}\frac 1{L^{6g-6+2r}}\{\gamma\text{ of type }\gamma_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. [less ▲] Detailed reference viewed: 37 (1 UL)Interrogating surface length spectra and quantifying isospectrality Parlier, Hugo E-print/Working paper (2016) 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 ... [more ▼] 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. [less ▲] Detailed reference viewed: 78 (2 UL)Geometric filling curves on surfaces ; Parlier, Hugo ; E-print/Working paper (2016) 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 ... [more ▼] 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. [less ▲] Detailed reference viewed: 94 (0 UL)Short closed geodesics with self-intersections ; Parlier, Hugo E-print/Working paper (2016) 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 ... [more ▼] 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$. [less ▲] Detailed reference viewed: 35 (1 UL)Distances in domino flip graphs Parlier, Hugo ; E-print/Working paper (2016) 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 ... [more ▼] 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. [less ▲] Detailed reference viewed: 36 (3 UL)Once punctured disks, non-convex polygons, and pointihedra Parlier, Hugo ; E-print/Working paper (2016) 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 ... [more ▼] 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. [less ▲] Detailed reference viewed: 77 (0 UL)Chromatic numbers of hyperbolic surfaces Parlier, Hugo ; in Indiana Univ. Math. J. (2016), 65(4), 1401--1423 Detailed reference viewed: 124 (3 UL)Filling sets of curves on punctured surfaces ; Parlier, Hugo in New York J. Math. (2016), 22 Detailed reference viewed: 29 (1 UL)Relative shapes of thick subsets of moduli space ; Parlier, Hugo ; in Amer. J. Math. (2016), 138(2), 473--498 Detailed reference viewed: 136 (4 UL) |
||