Related papers: All finite subdivision rules are combinatorially e…
Assuming that every hyperbolic group is residually finite, we prove the congruence subgroup property for mapping class groups of hyperbolic surfaces of finite type. Under the same assumption, it follows that profinitely equivalent…
Cutting a hyperbolic surface X along a simple closed multi-geodesic results in a hyperbolic structure on the complementary subsurface. We study the distribution of the shapes of these subsurfaces in moduli space as boundary lengths go to…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
We prove that the fundamental group of a finite graph of convergence groups with parabolic edge groups is a convergence group. Using this result, under some mild assumptions, we prove a combination theorem for a graph of convergence groups…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
Let G be a group admitting a non-elementary acylindrical action on a Gromov hyperbolic space (for example, a non-elementary relatively hyperbolic group, or the mapping class group of a closed hyperbolic surface, or Out(F_n) for n>1). We…
We consider splittings of groups over finite and two-ended subgroups. We study the combinatorics of such splittings using generalisations of Whitehead graphs. In the case of hyperbolic groups, we relate this to the topology of the boundary.…
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…
Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…
We prove a combination theorem for hyperbolic groups, in the case of groups acting on complexes displaying combinatorial features reminiscent of non-positive curvature. Such complexes include for instance weakly systolic complexes and…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We study the (Ahlfors regular) conformal dimension of the boundary at infinity of Gromov hyperbolic groups which split over elementary subgroups. If such a group is not virtually free, we show that the conformal dimension is equal to the…
In this paper we prove a general structure theorem for relatively hyperbolic groups (with arbitrary peripheral subgroups) acting naive convex co-compactly on properly convex domains in real projective space. We also establish a…
We prove that the Gromov boundary of every hyperbolic group is homeomorphic to some Markov compactum. Our reasoning is based on constructing a sequence of covers of $\partial G$, which is quasi-$G$-invariant wrt. the ball $N$-type (defined…
Mating is an operation that identifies the domains of a polynomial pair in order to obtain a new map on the resulting quotient space. The dynamics of the mating are then dependent on the two polynomials and the manner in which the quotient…
We develop the foundations of the theory of quasi-visual approximations of bounded metric spaces. Roughly speaking, these are sequences of covers of a given space for which the diameters of the sets in the covers shrink to zero and for…
The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the…
We develop a formalism that allows us to describe Markov compacta with finite sets of diagrams that are building blocks of the entire sequence. This encodes complex, continuous spaces with discrete collections of combinatorial objects. We…