Non-amenability of product replacement graphs
Abstract
We prove non-amenability of the product replacement graphs n(G) for uniformly non-amenable groups. We also prove it for Z-large groups, when n is sufficiently large. It follows that n(G) is non-amenable when n is sufficiently large for hyperbolic groups, linear groups, and elementary amenable groups.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.