Related papers: On a small cancellation theorem of Gromov

We characterize group compactifications of discrete groups for which there exists an equivariant retraction onto the boundary. In particular, we prove an equivariant analogue of Brouwer's No-Retraction theorem for large classes of group…

We develop a version of small cancellation theory in the variety of Burnside groups. More precisely, we show that there exists a critical exponent $n_0$ such that for every odd integer $n\geq n_0$, the well-known classical $C'(1/6)$-small…

A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…

This is an expository paper on Garland's vanishing theorem specialized to the case when the linear algebraic group is $\mathrm{SL}_n$. Garland's theorem can be stated as a vanishing of the cohomology groups of certain finite simplicial…

A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…

We generalize a version of small cancellation theory to the class of acylindrically hyperbolic groups. This class contains many groups which admit some natural action on a hyperbolic space, including non-elementary hyperbolic and relatively…

We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…

There has been some work in the literature on limit theorems for the trace of commutators for compact Lie groups. We revisit this from the perspective of combinatorial representation theory.

We construct a random model for an $n$-fold branched cover of a finite acceptable $2$-complex $X$. This includes presentation $2$-complexes for finitely presented groups satisfying some mild conditions. For any $\lambda >0$, we show that as…

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…

This paper, following (Dymetman:1998), presents an approach to grammar description and processing based on the geometry of cancellation diagrams, a concept which plays a central role in combinatorial group theory (Lyndon-Schuppe:1977). The…

The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…

We define the graph minor category and prove that the category of contravariant representations of the graph minor category over a Noetherian ring is locally Noetherian. This can be regarded as a categorification of the Robertson--Seymour…

Spielberg's construction of C*-algebras from left cancellative small categories is a common generalization for most C*-algebras one would consider to come from ``combinatorial data,'' including graph and $k$-graph C*-algebras, Li's…

We study combinatorial properties of the subshift induced by the substitution that describes Lysenok's presentation of Grigorchuk's group of intermediate growth by generators and relators. This subshift has recently appeared in two…

Small cancellation groups form an interesting class with many desirable properties. It is a well-known fact that small cancellation groups are generic; however, all previously known results of their genericity are asymptotic and provide no…

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

This expository paper gives an account of the Pila-Wilkie counting theorem and some of its extensions and generalizations. We use semialgebraic cell decomposition to simplify part of the original proof. We also include complete treatments…

We use the Graph Minor Theorem to characterize infinite sequences of finite subsets of factorial and commutative semigroups (here semigroups have a unity element), e.g. the multiplicative semigroup of a unique factorization domain.

We provide the details for Gromov's proof of Stallings' theorem on groups with infinitely many ends using harmonic functions. The main technical result of the paper is a compactness theorem for a certain family of harmonic functions.