SearcharxivSearch

arXiv · 2410.00146

The Reverse Representation Problem

Abstract

Cayley's theorem tells us that all groups $\mathbf{G}$ occur as subgroups of the group of automorphisms over some set $X$. In this paper we consider a `sort-of' converse to this question: given a set $X$ and some transformation group $\mathbf{S}$ over $X$, what are the possible group structures on $X$ that result in groups represented by $\mathbf{S}$? We solve this problem in the more general setting of faithful semigroups and observe that the solutions to this problem, which we term unrepresentations, have the structure of a heap. We study this phenomenon in depth and then move onto looking at particular classes of semigroups namely monoids, groups, inverse semigroups and Clifford semigroups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter F. Faul, Zurab Janelideze, Gideo Joubert. 2024-09-30. The Reverse Representation Problem. https://arxiv.org/abs/2410.00146

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