Search arXivSearch

arXiv · 2409.20495

Transitivity in wreath products with symmetric groups

Abstract

It is known that the notion of a transitive subgroup of a permutation group $P$ extends naturally to the subsets of $P$. We study transitive subsets of the wreath product $G \wr S_n$, where $G$ is a finite abelian group. This includes the hyperoctahedral group for $G=C_2$. We give structural characterisations of transitive subsets using the character theory of $G \wr S_n$ and interpret such subsets as designs in the conjugacy class association scheme of $G \wr S_n$. In particular, we prove a generalisation of the Livingstone-Wagner theorem and give explicit constructions of transitive sets. Moreover, we establish connections to orthogonal polynomials, namely the Charlier polynomials, and use them to study codes and designs in $C_r \wr S_n$. Many of our results extend results about the symmetric group $S_n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lukas Klawuhn, Kai-Uwe Schmidt. 2026-04-21. Transitivity in wreath products with symmetric groups. https://arxiv.org/abs/2409.20495

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO