2000 character limit reached
Weak amenability is stable under graph products
Published 15 Nov 2015 in math.GR | (1511.04645v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.