English
Related papers

Related papers: Graphs of Systoles on hyperbolic surfaces

200 papers

In this article, we construct a new simplicial complex for infinite-type surfaces, which we call the grand arc graph. We show that if the end space of a surface has at least three different self-similar equivalence classes of maximal ends,…

Geometric Topology · Mathematics 2022-01-31 Assaf Bar-Natan , Yvon Verberne

In this paper we consider a large family of graphs of hierarchically hyperbolic groups (HHG) and show that their fundamental groups admit HHG structures. To do that, we will investigate the notion of hierarchical quasi convexity and show…

Group Theory · Mathematics 2018-01-08 Davide Spriano

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

Combinatorics · Mathematics 2016-10-26 Huda Chuangpishit , Jeannette Janssen

We consider the ortho spectrum of hyperbolic surfaces with totally geodesic boundary. We show that in general the ortho spectrum does not determine the systolic length but that there are only finitely many possibilities. As a corollary we…

Geometric Topology · Mathematics 2022-01-19 Hidetoshi Masai , Greg McShane

We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we…

Geometric Topology · Mathematics 2014-05-20 Ursula Hamenstaedt

Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…

Geometric Topology · Mathematics 2023-06-07 Shuchi Agrawal , Tarik Aougab , Yassin Chandran , Marissa Loving , J. Robert Oakley , Roberta Shapiro , Yang Xiao

Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…

Geometric Topology · Mathematics 2024-06-10 Inasa Nakamura

We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2\pi.$ The combinatorial information of these surfaces is shown to be identified with…

Metric Geometry · Mathematics 2022-10-10 Yohji Akama , Bobo Hua

This article deals with the set of closed geodesics on complete finite type hyperbolic surfaces. For any non-negative integer $k$, we consider the set of closed geodesics that self-intersect at least $k$ times, and investigate those of…

Geometric Topology · Mathematics 2019-12-23 Thi Hanh Vo

We show that for every $\epsilon>0$, there exists a compact lamination by $\epsilon$-holomorphic surfaces in the complex projective plane, minimal, and that carries hyperbolic holonomy. We call $\epsilon$-holomorphic a real 2-dimensional…

Dynamical Systems · Mathematics 2007-05-23 Bertrand Deroin

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.

Geometric Topology · Mathematics 2017-05-31 Ara Basmajian , Hugo Parlier , Juan Souto

A graph G on omega_1 is called <omega-smooth if for each uncountable subset W of omega_1, G is isomorphic to G[W-W'] for some finite W'. We show that in various models of ZFC if a graph G is <omega-smooth then G is necessarily trivial, i.e,…

Logic · Mathematics 2010-03-17 Lajos Soukup

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

Combinatorics · Mathematics 2023-10-31 Martin Milanič , Nicolas Trotignon

A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…

Combinatorics · Mathematics 2025-06-16 Rupert H. Levene , Polona Oblak , Helena Šmigoc

We establish three criteria of hyperbolicity of a graph in terms of ``average width of geodesic bigons''. In particular we prove that if the ratio of the Van Kampen area of a geodesic bigon $\beta$ and the length of $\beta$ in the Cayley…

Group Theory · Mathematics 2022-12-27 Victor Gerasimov , Leonid Potyagailo

Our main result is that for all sufficiently large $x_0>0$, the set of commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds with fixed invariant trace field $k$ and systole bounded below by $x_0$ has density one within the…

Geometric Topology · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Paul Pollack , Lola Thompson

The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…

Combinatorics · Mathematics 2007-05-23 Janos Barat , Jiri Matousek , David R. Wood

We construct minimal laminations by hyperbolic surfaces whose generic leaf is a disk and contain any prescribed family of surfaces and with a precise control of the topologies of the surfaces that appear. The laminations are constructed via…

Geometric Topology · Mathematics 2022-02-03 Sébastien Alvarez , Joaquín Brum , Matilde Martínez , Rafael Potrie

This is an expository essay about systolic geometry. It describes a central theorem in the subject and why the proof is difficult. Then it discusses different metaphors which suggest ways to approach the problem. The metaphors connect the…

Differential Geometry · Mathematics 2010-03-23 Larry Guth

We prove that the cut space of any transitive graph $G$ is a finitely generated ${\rm Aut}(G)$-module if the same is true for its cycle space. This confirms a conjecture of Diestel which says that every locally finite transitive graph whose…

Combinatorics · Mathematics 2014-11-26 Matthias Hamann