Non-amenability of product replacement graphs
Group Theory
2013-05-13 v1 Combinatorics
Abstract
We prove non-amenability of the product replacement graphs \Gamma_n(G) for uniformly non-amenable groups. We also prove it for Z-large groups, when n is sufficiently large. It follows that \Gamma_n(G) is non-amenable when n is sufficiently large for hyperbolic groups, linear groups, and elementary amenable groups.
Cite
@article{arxiv.1305.2408,
title = {Non-amenability of product replacement graphs},
author = {Anton Malyshev},
journal= {arXiv preprint arXiv:1305.2408},
year = {2013}
}
Comments
9 pages