SearcharxivSearch

arXiv · 2606.24274

The endomorphism tower of a finite symmetric group

Abstract

We consider the endomorphism tower of a monoid $M$, that is, the sequence of monoids End$_i(M)$ where End$_0(M)=M$ and for all $i\geq 1$, End$_i(M)$ is the monoid of all endomorphisms of End$_{i-1}(M)$. We show that for a finite monoid $M$ this sequence does not stabilise in a finite number of steps. Our focus is then on the case where $M=\mathcal{S}_n$, the symmetric group on a finite number $n$ of points. It is well known that other than in exceptional cases (which are avoided by taking $n \geq 7$), the corresponding automorphism tower of $\mathcal{S}_n$ stabilises at the first step. In spite of the natural nature of this question, nothing was known of the endomorphism tower above the level $i=1$. We determine (for each $n \geq 7)$ the elements of End$_2(\mathcal{S}_n)$ and their multiplication and thus verify that the monoids End$_i(\mathcal{S}_n)$ for $i=0,1,2$ all have group of units isomorphic to $\mathcal{S}_n$. We show that the same is true of End$_3(\mathcal{S}_n)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Victoria Gould, Ambroise Grau, Marianne Johnson, Jamie Smith. 2026-06-23. The endomorphism tower of a finite symmetric group. https://arxiv.org/abs/2606.24274

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