相关论文: Small cancellation labellings of some infinite gra…

Gromov (2003) constructed finitely generated groups whose Cayley graphs contain all graphs from a given infinite sequence of expander graphs of unbounded girth and bounded diameter-to-girth ratio. These so-called Gromov monster groups…

We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned-off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented)…

We extend fundamental results of small cancellation theory to groups whose presentations satisfy the generalizations of the classical C(6) and C(7) conditions in graphical small cancellation theory. Using these graphical small cancellation…

We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the graphical C'(lambda)-small cancellation condition with respect to graphs endowed with a compatible…

We use the interplay between combinatorial and coarse geometric versions of negative curvature to investigate the geometry of infinitely presented graphical $Gr'(1/6)$ small cancellation groups. In particular, we characterize their…

An infinite graph G is minor excluded if there is a finite graph that is not a minor of G. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups.…

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the C'(1/6)-small cancellation condition. We deduce that these groups are coarsely embeddable into a…

We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…

We construct an uncountable family of groups of type $FP$. In contrast to every previous construction of non-finitely presented groups of type $FP$ we do not use Morse theory on cubical complexes; instead we use Gromov's graphical small…

A piece of a labelled graph $\Gamma$ defined by D. Gruber is a labelled path that embeds into $\Gamma$ in two essentially different ways. We prove that graphical $Gr'(\frac{1}{6})$ small cancellation groups whose associated pieces have…

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…

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…

We construct the first examples of residually finite non-exact groups. The construction is based on author's earlier construction of groups containing isometrically expanders using a graphical small cancellation.

We study permanence results for almost quasi-isometries, the maps arising from the Gromov construction of finitely generated random groups that contain expanders (and hence that are not C*-exact). We show that the image of a sequence of…

We give a combinatorial proof of a theorem of Gromov, which extends the scope of small cancellation theory to group presentations arising from labelled graphs.

In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…

Graphical small cancellation extends the classical small cancellation theory and provides a powerful method for constructing groups with interesting features. In the classical setting, C(3)-T(6) small cancellation complexes are known to…

We determine the large scale geometry of the minimal displacement set of a hyperbolic isometry of a systolic complex. As a consequence, we describe the centraliser of such an isometry in a systolic group. Using these results, we construct a…

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…