Internal graphs of graph products of hyperfinite -factors

Internal graphs of graph products of hyperfinite $\mathrm{II}_{1}$-factors cover
Download PDF

A subscription is required to access this article.

Abstract

In this paper, we show that for a graph from a class named H-rigid graphs, its subgraph , named the internal graph of , is an isomorphism invariant of the graph product of hyperfinite -factors . In particular, we can classify for some typical types of graphs, including lines, cyclic graphs and infinite regular trees. As an application, we also show that for two isomorphic graph products of hyperfinite -factors over H-rigid graphs, the difference of the radius between the two graphs will not be larger than . Our proof is based on the recent resolution of the Peterson–Thom conjecture.

Cite this article

Martijn Caspers, Enli Chen, Internal graphs of graph products of hyperfinite -factors. J. Noncommut. Geom. (2026), published online first

DOI 10.4171/JNCG/681