SearcharxivSearch

arXiv · 2606.21928

On Codes in (Generalized) Symmetric Groups

Abstract

In this article, we show that, for the symmetric group $S_n$, the Young subgroup $S_{\lambda}$, with $l(\lambda)\geq 3$, is not a code with respect to a conjugacy class of $S_n$. This provides a partial answer to \cite[Problem 4.1]{FL26}. We then provide a characterization of conjugacy classes $X_i$, such that subgroups $S_{(n-2,1,1)}$, $S_{(n-3,2,1)}$, and $Y_k$ for $k\leq 3$ are codes for $X_1 \cup X_2$. Furthermore, we describe some codes in the finite Coxeter groups of type $B_n$, $C_n$, $D_n$, and in the generalized symmetric group $C_m \wr S_n$.

Explore related subjects

Keep this discovery

BibTeXRIS

Subrata Barman, Pushpendra Singh. 2026-06-20. On Codes in (Generalized) Symmetric Groups. https://arxiv.org/abs/2606.21928

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