Internal graphs of graph products of hyperfinite II1-factors

Abstract

In this paper, we show that for a graph from a class named H-rigid graphs, its subgraph Int(), named the internal graph of , is an isomorphism invariant of the graph product of hyperfinite II1-factors R. In particular, we can classify R for some typical types of graphs, such as lines, cyclic graphs and infinite regular trees. As an application, we also show that for two isomorphic graph products of hyperfinite II1-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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…