Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rigid Graph Products (2408.06171v2)

Published 12 Aug 2024 in math.OA and math.FA

Abstract: We prove rigidity properties for von Neumann algebraic graph products. We introduce the notion of rigid graphs and define a class of II$1$-factors named $\mathcal{C}{\rm Rigid}$. For von Neumann algebras in this class we show a unique rigid graph product decomposition. In particular, we obtain unique prime factorization results and unique free product decomposition results for new classes of von Neumann algebras. Furthermore, we show that for many graph products of II$_1$-factors, including the hyperfinite II$_1$-factor, we can, up to a constant 2, retrieve the radius of the graph from the graph product. We also prove several technical results concerning relative amenability and embeddings of (quasi)-normalizers in graph products. Furthermore, we give sufficient conditions for a graph product to be nuclear and characterize strong solidity, primeness and free-indecomposability for graph products.

Summary

We haven't generated a summary for this paper yet.