SearcharxivSearch

arXiv · 2605.21025

Termination of the Lattice-Automorphism Tower for Direct Products of Symmetric Groups

Abstract

Let $G$ be a finite group. Let $\mathcal{N}(G)$ be the lattice of normal subgroups ordered by inclusion, regarded as an abstract lattice. Define $\operatorname{LatAut}(G) := \operatorname{Aut}(\mathcal{N}(G))$. The \emph{LatAut tower} is the sequence defined by $G_0 = G$, $G_{n+1} = \operatorname{LatAut}(G_n)$. Let $G$ be a \emph{tower group} if $G \cong \prod_{k \geq 3} S_k^{a_k}$ with finitely many $a_k \neq 0$. We establish the following for tower groups. \emph{Product Formula.} $\operatorname{LatAut}\!\bigl(\prod_{k \geq 3} S_k^{a_k}\bigr) \cong S_{a_4} \times S_B$, where $B = \sum_{k \geq 3,\, k \neq 4} a_k$. \emph{Termination Theorem.} For every tower group $G_0$, we prove that $G_3 = 1$, and that this bound is sharp. The proof applies Goursat's lemma to classify $\mathcal{N}(G)$ into three families parameterised by admissible triples $(J,\mathbf{P},H)$ as sub-products, sign-parity elements, and mixed elements, and uses the Krull--Schmidt theorem to identify the direct factors $S_k^{(k,i)}$ as precisely the nontrivial indecomposable complemented elements of $\mathcal{N}(G)$ (the complemented elements being exactly the full sub-products). These results do not extend to groups outside the tower-group family.

Explore related subjects

Keep this discovery

BibTeXRIS

Sonukumar, Vinay Madhusudanan. 2026-05-20. Termination of the Lattice-Automorphism Tower for Direct Products of Symmetric Groups. https://arxiv.org/abs/2605.21025

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