Relative bi-exactness and structural results for graph-wreath product von Neumann algebras
Taisuke Hoshino

TL;DR
This paper investigates the property of relative bi-exactness in graph product and graph-wreath product von Neumann algebras, establishing new structural results and applications in rigidity and prime factor classification.
Contribution
It proves relative bi-exactness for these algebras assuming component groups are exact, and applies this to rigidity results and prime factor construction.
Findings
Established relative bi-exactness for graph product von Neumann algebras.
Proved relative bi-exactness for graph-wreath product von Neumann algebras.
Derived rigidity results for certain graph-wreath products and constructed new prime II_1 factors.
Abstract
We study relative bi-exactness of graph product and graph-wreath product group von Neumann algebras. In particular, we obtain the relative bi-exactness for graph product von Neumann algebras and graph-wreath product von Neumann algebras , assuming that the component groups are exact. We adopt the -algebraic method of Ozawa for the proof. As an application, for a certain class of graph-wreath products, we establish the rigidity result for the quotient graph under stable isomorphism. Furthermore, we obtain a new family of prime factors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Rings, Modules, and Algebras · Advanced Topics in Algebra
