Related papers: Infinite Unicorn Paths and Gromov Boundaries

Let S be an orientable surface of finite type. Using Pho-On's infinite unicorn paths, we prove the hyperfiniteness of orbit equivalence relations induced by the actions of the mapping class group of S on the Gromov boundaries of the arc…

We investigate the geometry of the graphs of nonseparating curves for surfaces of finite positive genus with potentially infinitely many punctures. This graph has infinite diameter and is known to be Gromov hyperbolic by work of the author.…

We give a combinatorial proof of an unpublished result of E. Klarreich: The Gromov boundary of the complex of curves of a non-exceptional oriented surface S of finite type can naturally be identified with the space of minimal geodesic…

Diestel and K\"uhn proved that the topological ends of an infinite graph are precisely its undominated graph ends, yielding a canonical embedding of the space of topological ends into the space of graph ends. For edge-ends, introduced by…

We give a uniform bound of the bounded geodesic image theorem for the closed oriented surfaces. The proof utilizes the bicorn curves introduced by Przytycki and Sisto (see arXiv:1502.02176). With the uniformly bounded Hausdorff distance of…

Let $N$ be a connected finite type nonorientable surface with or without boundary components and punctures. We prove that the graph of nonseparating curves of $N$ is connected and Gromov hyperbolic with a constant which does not depend on…

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…

Coning off a collection of uniformly quasiconvex subsets of a Gromov hyperbolic space leaves a new space, called the cone-off. Kapovich and Rafi generalized work of Bowditch to show this space is still Gromov hyperbolic. We show that the…

We say that two graphs on the same vertex set are $G$-creating if their union (the union of their edges) contains $G$ as a subgraph. Let $H_n(G)$ be the maximum number of pairwise $G$-creating Hamiltonian paths of $K_n$. Cohen, Fachini and…

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric, the asymptotic dimension can be seen as a large scale…

We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution…

We define an ending lamination for a Weil-Petersson geodesic ray. Despite the lack of a natural visual boundary for the Weil-Petersson metric, these ending laminations provide an effective boundary theory that encodes much of its asymptotic…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

A lamination $\lambda$ is $\epsilon$-thick (with respect to a basepoint $X$), if the Teichm\"uller ray from $X$ in the direction of $\lambda$ stays in the $\epsilon$-thick part. We show that, for surfaces of high enough genus, any two…

Hierarchically hyperbolic spaces provide a common framework for studying mapping class groups of finite type surfaces, Teichm\"uller space, right-angled Artin groups, and many other cubical groups. Given such a space $\mathcal X$, we build…

The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2019 as a common generalization of avoidable vertices and simplicial paths. In 2020, Bonamy, Defrain, Hatzel, and…

In this paper, we introduce the notion of infinity branches as well as approaching curves. We present some properties which allow us to obtain an algorithm that compares the behavior of two implicitly defined algebraic plane curves at the…

Given a compact surface $\Sigma$ with boundary and a relation $\Gamma$ on $\pi_0(\partial\Sigma)$, we define the prescribed arc graph $\mathscr A(\Sigma,\Gamma)$ to be the full subgraph of the arc graph $\mathscr A(\Sigma)$ containing only…

We study random unlabelled $k$-dimensional trees by combining the colouring approach by Gainer-Dewar and Gessel (2014) with the cycle pointing method by Bodirsky, Fusy, Kang and Vigerske (2011). Our main applications are…