Related papers: Non-amenability of product replacement graphs

Let $\Gamma$ be a discrete countable group. The first main result of this work is that if $\Gamma$ is ICC inner-amenable non-amenable then it cannot satisfy the (AO)-property, answering a question posed by C. Anantharaman-Delaroche. It is…

We show that, if $G$ is an amenable group and $H$ is a hyperbolic group, then the free product $G\ast H$ is weakly amenable. A key ingredient in the proof is the fact that $G\ast H$ is orbit equivalent to $\mathbb{Z}\ast H$.

We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.

We study the notion of permutation stability (or P-stability) for countable groups. Our main result provides a wide class of non-amenable product groups which are not P-stable. This class includes the product group $\Sigma\times\Lambda$,…

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we…

The non--commuting graph $\Gamma(G)$ of a non--abelian group $G$ is defined as follows. The vertex set $V(\Gamma(G))$ of $\Gamma(G)$ is $G\setminus Z(G)$ where $Z(G)$ denotes the center of $G$ and two vertices $x$ and $y$ are adjacent if…

Let G be a locally compact group, and ZL1(G) be the centre of its group algebra. We show that when $G$ is compact ZL1(G) is not amenable when G is either nonabelian and connected, or is a product of infinitely many finite nonabelian groups.…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

We consider groups of automorphisms of locally finite trees, and give conditions on its subgroups that imply that they are not elementary amenable. This covers all known examples of groups that are not elementary amenable and act on the…

The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…

Let $\Gamma'<\Gamma$ be two discrete groups acting properly by isometries on a Gromov-hyperbolic space $X$. We prove that their critical exponents coincide if and only if $\Gamma'$ is co-amenable in $\Gamma$, under the assumption that the…

We give examples of non-amenable ICC groups $\Gamma$ with the Haagerup property, weakly amenable with constant $\Lambda_{\cb}(\Gamma) = 1$, for which we show that the associated ${\rm II_1}$ factors $L(\Gamma)$ are strongly solid, i.e. the…

A graph $\Gamma$ is said to be stable if $\mathrm{Aut}(\Gamma\times K_2)\cong\mathrm{Aut}(\Gamma)\times \mathbb{Z}_{2}$ and unstable otherwise. If an unstable graph is connected, non-bipartite and any two of its distinct vertices have…

Let $G$ be a finite group. For $x \in G$, we define the solvabilizer of $x$ in $G$, denoted $sol_G(x)$, to be the set $\{g \in G \mid \langle g,x \rangle$ is solvable$\}$. A group $G$ is an S-group if $sol_G(x)$ is a subgroup of $G$ for…

We associate a graph $\mathcal{C}_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | < x,y> \text{is cyclic for all} y\in G\}$ is called…

In this paper we study obstructions to presentability by products for finitely generated groups. Along the way we develop both the concept of acentral subgroups, and the relations between presentability by products on the one hand, and…

We prove the exponential growth of product replacement graphs for a large class of groups. Much of our effort is dedicated to the study of product replacement graphs of Grigorchuk groups, where the problem is most difficult.

We introduce an obstruction to the existence of a coarse embedding of a given group or space into a hyperbolic group, or more generally into a hyperbolic graph of bounded degree. The condition we consider is "admitting exponentially many…

We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local…