Small cancellation labellings of some infinite graphs and applications
By Damian Osajda. Acta Mathematica, 2014
111 citations recorded by the source corpus.
We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of groups with exotic properties: - We construct the first examples of finitely generated coarsely non-amenable groups (that is, groups without Guoliang Yu's Property A) that are coarsely embeddable into a Hilbert space. Moreover, our groups act properly on CAT(0) cubical complexes. - We construct the first examples of finitely generated groups, with expanders embedded isometrically into their Cayley graphs - in contrast,in the case of the Gromov monster expanders are not even coarsely embedded. We present further applications.
Subfields: Geometry and Topology, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/58c551be3bdd698b8401bb1a483dcaf0f1cb558d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Geometry and Topology
- Dominik Gruber
- Alessandro Sisto
- Jason A. Behrstock
- Mark F. Hagen
- Hung Cong Tran
- Denis V. Osin
- Anthony Genevois
In Mathematical Physics
- Dominik Gruber
- Alessandro Sisto
- Mark F. Hagen
- Jason A. Behrstock
- Hung Cong Tran
- Denis V. Osin
- Anthony Genevois
Citations in the corpus
- Infinitely presented graphical small cancellation groups are acylindrically hyperbolic (2014, background): “Following this, Osajda recently showed, by probabilistic arguments, the existence of suitable small cancellation labellings of certain expander graphs [Osa14], thus completing this combinatorial construction.”