Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rigid Graph Products

Published 12 Aug 2024 in math.OA and math.FA | (2408.06171v2)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.