SearcharxivSearch

arXiv · 2312.15732

Rigidity and automorphisms of groups constructed using Jones' technology

Abstract

Jones' technology, developed by Vaughan Jones during his exploration of the connections between conformal field theory and subfactors, is a powerful mechanism for generating actions of groups coming from categories, notably Richard Thompson's groups $F \subseteq T \subseteq V$. We give a structure theorem for the isomorphisms between split extensions of Thompson's group $V$ arising from Jones' technology, generalising results of Brothier. Using this structure theorem, we classify a family of unrestricted, twisted permutational wreath products up to isomorphism, and decompose their automorphism groups in the untwisted case. These unrestricted wreath products arise from applying Jones' technology to contravariant monoidal functors. In contrast, using covariant functors, Brothier constructed a large class of restricted wreath products, classified them up to isomorphism, and completely described their automorphism groups. Our work broadens Brothier's findings and highlights the duality between groups constructed using covariant and contravariant functors.

Explore related subjects

Keep this discovery

BibTeXRIS

Christian De Nicola Larsen. 2023-12-25. Rigidity and automorphisms of groups constructed using Jones' technology. https://arxiv.org/abs/2312.15732

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