SearcharxivSearch

arXiv · 1108.3611

Embedding permutation groups into wreath products in product action

Abstract

The wreath product of two permutation groups G < Sym(Gamma) and H < Sym(Delta) can be considered as a permutation group acting on the set Pi of functions from Delta to Gamma. This action, usually called the product action, of a wreath product plays a very important role in the theory of permutation groups, as several classes of primitive or quasiprimitive groups can be described as subgroups of such wreath products. In addition, subgroups of wreath products in product action arise as automorphism groups of graph products and codes. In this paper we consider subgroups X of full wreath products Sym(Gamma) wr Sym(Delta) in product action. Our main result is that, in a suitable conjugate of X, the subgroup of Sym(Gamma) induced by a stabilizer of a coordinate delta in Delta only depends on the orbit of delta under the induced action of X on Delta. Hence, if the action of X on Delta is transitive, then X can be embedded into a much smaller wreath product. Further, if this X-action is intransitive, then X can be embedded into a direct product of such wreath products where the factors of the direct product correspond to the X-orbits in Delta. We offer an application of the main theorems to error-correcting codes in Hamming graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Cheryl E. Praeger, Csaba Schneider. 2011-08-18. Embedding permutation groups into wreath products in product action. https://arxiv.org/abs/1108.3611

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