2000 character limit reached
Internal graphs of graph products of hyperfinite II$_1$-factors (2505.05179v1)
Published 8 May 2025 in math.OA
Abstract: In this paper, we show that for a graph $\Gamma$ from a class named H-rigid graphs, its subgraph ${\rm Int}(\Gamma)$, named the internal graph of $\Gamma$, is an isomorphism invariant of the graph product of hyperfinite II$1$-factors $R{\Gamma}$. In particular, we can classify $R_{\Gamma}$ for some typical types of graphs, such as lines and cyclic graphs. As an application, we also show that for two isomorphic graph products of hyperfinite II$_1$-factors over H-rigid graphs, the difference of the radius between the two graphs will not be larger than 1. Our proof is based on the recent resolution of the Peterson-Thom conjecture.