Conjugating automorphisms of graph products: Kazhdan's property (T) and SQ-universality
classification
🧮 math.GR
keywords
conjugatinggraphautomorphismsfactorkazhdanproductpropertysatisfies
read the original abstract
An automorphism of a graph product of groups is conjugating if it sends each factor to a conjugate of a factor (possibly different). In this article, we determine precisely when the group of conjugating automorphisms of a graph product satisfies Kazhdan's property (T) and when it satisfies some vastness properties including SQ-universality.
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.