Related papers: Weak amenability is stable under graph products
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
A common fixed point property for semigroups is applied to show that the group algebra $L^1(G)$ of a locally compact group $G$ is $2m$-weakly amenable for each integer $m\geq 1$.
Graph products for groups were defined by Green in her thesis as a generalization of both Cartesian and free products. In this paper we define the corresponding graph product for reduced and maximal C*-algebras, von Neumann algebras and…
In this paper, we study weak amenability of Beurling algebras. To this end, we introduce the notion inner quasi-additive functions and prove that for a locally compact group $G$, the Banach algebra $L^1(G, \omega)$ is weakly amenable if and…
A group is said to be strongly amenable if each of its proximal topological actions has a fixed point. We show that a finitely generated group is strongly amenable if and only if it is virtually nilpotent. More generally, a countable…
The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…
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$.
For a topological group $G$, amenability can be characterized by the amenability of the convolution Banach algebra $L^1(G)$. Here a Banach algebra $A$ is called amenable if every bounded derivation from $A$ into any dual--type…
A weakly admissible mesh (WAM) on a continuum real-valued domain is a sequence of discrete grids such that the discrete maximum norm of polynomials on the grid is comparable to the supremum norm of polynomials on the domain. The asymptotic…
Let $G$ be a locally compact group. If $G$ is finite then the amenability constant of its Fourier algebra, denoted by ${\rm AM}({\rm A}(G))$, admits an explicit formula [Johnson, JLMS 1994]; if $G$ is infinite then no such formula for ${\rm…
In this paper, we introduce a weak form of amenability on topological semigroups that we call $\varphi$-amenability, where $\varphi$ is a character on a topological semigroup. Some basic properties of this new notion are obtained and by…
We investigate amenability for $W^*$-Fell bundles over a discrete group $G$, with a focus on its characterization via approximation properties and conditional expectations. Building on the notion of $W^*$-amenability, we construct an…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We establish several new characterizations of amenable $W^*$- and $C^*$-dynamical systems over arbitrary locally compact groups. In the $W^*$-setting we show that amenability is equivalent to (1) a Reiter property and (2) the existence of a…
We define two different weakenings of coarse amenability (also known as Yu's property A), namely fibred coarse amenability and coarse amenability at infinity. These two properties allow us to prove that a residually finite group is coarsely…
We make a comprehensive and self-contained study of compact bicrossed products arising from matched pairs of discrete groups and compact groups. We exhibit an automatic regularity property of such a matched pair and and produce an easy…
A topological group $G$ is extremely amenable if every continuous action of $G$ on a compact space has a fixed point. Using the concentration of measure techniques developed by Gromov and Milman, we prove that the group of automorphisms of…
We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…
In this paper, a group is called weakly amenable if its left regular representation is not uniformly isolated from the trivial representation. First examples of finitely generated non-amenable weakly amenable groups are constructed.
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [8], the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph.…