Weak amenability is stable under graph products
classification
🧮 math.GR
keywords
graphproductsdiscretegroupsamenabilityamenableboundedcompletely
read the original abstract
Weak amenability of discrete groups was introduced by Haagerup and co-authors in the 1980's. It is an approximation property known to be stable under direct products and free products. In this paper we show that graph products of weakly amenable discrete groups are weakly amenable (with Cowling-Haagerup constant 1). Along the way we construct a wall space associated to the word length structure of a graph product and also give a method for extending completely bounded functions on discrete groups to a completely bounded function on their graph product.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.