SearcharxivSearch

arXiv · 2207.03100

Forest-skein groups I: between Vaughan Jones' subfactors and Richard Thompson's groups

Abstract

Vaughan Jones discovered unexpected connections between Richard Thompson's group and subfactor theory while attempting to construct conformal field theories (in short CFT). Among other this founded Jones' technology: a powerful new method for constructing actions of fraction groups which had numerous applications in mathematical physics, operator algebras, group theory and more surprisingly in knot theory and noncommutative probability theory. We propose and outline a program in the vein of Jones' work but where the Thompson group is replaced by a family of groups that we name forest-skein groups. These groups are constructed from diagrammatic categories, are tailor-made for using Jones' technology, capture key aspects of the Thompson group, and aim to better connect subfactors with CFT. Our program strengthens Jones' visionary work and moreover produces a plethora of concrete groups which satisfy exceptional properties. In this first article we introduce the general theory of forest-skein groups, provide criteria of existence, give explicit presentations, prove that their first L$^2$-Betti number vanishes, construct a canonical action on a totally ordered set, establish a topological finiteness theorem showing that many of our groups are of type $F_\infty$, and finish by studying a beautiful class of explicit examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Arnaud Brothier. 2022-07-07. Forest-skein groups I: between Vaughan Jones' subfactors and Richard Thompson's groups. https://arxiv.org/abs/2207.03100

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR