A new upgrade theorem for relative biexactness under mixing conditions yields a classification of biexactness for graph products of finite-dimensional von Neumann algebras, extending prior results.
Structure of relatively biexact group von
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Von Neumann algebras of Artin groups encode the number of connected components of their defining graphs except possibly for free-group-factor cases; a similar result holds for Coxeter groups absent relative hyperbolicity.
citing papers explorer
-
Relative biexactness and mixing in von Neumann algebras
A new upgrade theorem for relative biexactness under mixing conditions yields a classification of biexactness for graph products of finite-dimensional von Neumann algebras, extending prior results.
-
On free components of Artin and Coxeter groups
Von Neumann algebras of Artin groups encode the number of connected components of their defining graphs except possibly for free-group-factor cases; a similar result holds for Coxeter groups absent relative hyperbolicity.