Related papers: All finite subdivision rules are combinatorially e…

Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…

A major challenge in the study of the structure of the three-dimensional homology cobordism group is to understand the interaction between hyperbolic geometry and homology cobordism. In this paper, for a hyperbolic homology sphere $Y$ we…

We show that if a hyperbolic group acts geometrically on a CAT(0) cube complex, then the induced boundary action is hyperfinite. This means that for a cubulated hyperbolic group the natural action on its Gromov boundary is hyperfinite,…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

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,…

This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large…

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…

We identify the images of the comparision maps from ordinary homology and Sobolev homology, respectively, to the $l^1$-homology of a word-hyperbolic group with coefficients in complete normed modules. The underlying idea is that there is a…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

In this paper, we explore three combinatorial descriptions of semistable types of hyperelliptic curves over local fields: dual graphs, their quotient trees by the hyperelliptic involution, and configurations of the roots of the defining…

Suppose that a finitely generated group $G$ is hyperbolic relative to a collection of subgroups $\{H_1, ..., H_m\} $. We prove that if each of the subgroups $H_1, ..., H_m$ has finite asymptotic dimension, then asymptotic dimension of $G$…

We show equivalences between several high-dimensional problems in extremal combinatorics and parallel repetition of multiplayer (multiprover) games over large answer alphabets. This extends the forbidden-subgraph technique, previously…

A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

The paper is concerned with Kropholler's conjecture on splitting a finitely generated group over a codimension-1 subgroup. For a subgroup H of a group G, we define the notion of "finite splitting height" which generalises the finite-height…

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…