Related papers: All finite subdivision rules are combinatorially e…

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

We prove that if a compact $n$-manifold admits a sequence of residual covers that form a coboundary expander in dimension $n-2$, then the manifold has Gromov-hyperbolic fundamental group. In particular, residual sequences of covers of…

Let $G$ be a finitely generated group. Cashen and Mackay proved that if the contracting boundary of $G$ with the topology of fellow travelling quasi-geodesics is compact then $G$ is a hyperbolic group. Let $\mathcal{H}$ be a finite…

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

We prove uniform boundedness of certain boundary representations on appropriate fractional Sobolev spaces $W^{s,p}$ with $p>1$ for arbitrary Gromov hyperbolic groups. These are closed subspaces of $L^p$ and in particular Hilbert spaces in…

In 2013, Chan classified all metric hyperelliptic graphs, proving that divisorial gonality and geometric gonality are equivalent in the hyperelliptic case. We show that such a classification extends to combinatorial graphs of divisorial…

We prove that, if a group is relatively hyperbolic, the parabolic subgroups are virtually nilpotent if and only if there exists a hyperbolic space with bounded geometry on which it acts geometrically finitely. This provides, by use of M.…

We define hyperbolic groupoids, generalizing the notion of a Gromov hyperbolic group. Examples of hyperbolic groupoids include actions of Gromov hyperbolic groups on their boundaries, pseudogroups generated by expanding self-coverings,…

Gromov and Piatetski-Shapiro proved existence of finite volume non-arithmetic hyperbolic manifolds of any given dimension. In dimension four and higher, we show that there are about v^v such manifolds of volume at most v, considered up to…

The Kruskal-Katona theorem together with a theorem of Razborov determine the closure of the set of points defined by the homomorphism density of the edge and the triangle in finite graphs. The boundary of this region is a countable union of…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

In this paper we study the global geometry of the Kobayashi metric on domains in complex Euclidean space. We are particularly interested in developing necessary and sufficient conditions for the Kobayashi metric to be Gromov hyperbolic. For…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. It is proved that the…

The divisor theory for graphs is compared to the theory of linear series on curves through the correspondence associating a curve to its dual graph. An algebro-geometric interpretation of the combinatorial rank is proposed, and proved in…

We study the algebraic rank of a divisor on a graph, an invariant defined using divisors on algebraic curves dual to the graph. We prove it satisfies the Riemann-Roch formula, a specialization property, and the Clifford inequality. We prove…

Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface…

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…