A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS

DOI10.1112/S0024610705022441MaRDI QIDQ3377398zbMATH OpenOpenAlexFDO

Authors Bruce E. Sagan, William J. Martin

Publication date 22 March 2006

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0206163

zbMATH Keywords

\(t\)-homogeneous\(t\)-transitiveassociation schemedesignordered set partitionpartitionpermutation grouppermutation setsymmetric grouptabloidYoung subgroup

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial aspects of representation theory (05E10) Association schemes, strongly regular graphs (05E30) Multiply transitive finite groups (20B20)

Abstract: Let $Omega=1,2,\mathrm{...},n$ where $nge2$. The {em shape} of an ordered set partition $P=(P_1,\mathrm{...},P_k)$ of $Omega$ is the integer partition $lambda=(lambd{a}_1,\mathrm{...},lambd{a}_k)$ defined by $lambd{a}_i=|P_i|$. Let G be a group of permutations acting on $Omega$. For a fixed partition $lambda$ of n, we say that G is {em $lambda$-transitive} if G has only one orbit when acting on partitions P of shape $la$. A corresponding definition can also be given when G is just a set. For example, if $lambda=(n-t,1,\mathrm{...},1)$, then a $lambda$-transitive group is the same as a t-transitive permutation group and if $lambda=(n-t,t)$, then we recover the t-homogeneous permutation groups. In this paper, we use the character theory of the symmetric group $S_n$ to establish some structural results regarding $lambda$-transitive groups and sets. In particular, we are able to generalize a theorem of Livingstone and Wagner about t-homogeneous groups. We survey the relevant examples coming from groups. While it is known that a finite group of permutations can be at most 5-transitive unless it contains the alternating group, we show that it is possible to construct a non-trivial t-transitive set of permutations for each positive integer t. We also show how these ideas lead to a split basis for the association scheme of the symmetric group.

Recommendations

• On t-homogeneous permutation sets
• Sharply \((n-2)\)-transitive sets of permutations
• The classification of partition homogeneous groups with applications to semigroup theory
• ORBIT-HOMOGENEITY IN PERMUTATION GROUPS
• On some sharply t-transitive sets

Cited in

(16)

• Commutative association schemes
• On some sharply t-transitive sets
• Monotypical uniformly homogeneous sets of permutations
• A complete classification of which (n,k)-star graphs are Cayley graphs
• Large sets with multiplicity
• \(r\)-regular families of graph automorphisms
• The transitivity of Conway's \(M_{13}\)
• A combinatorial approach to transitive extensions of generously unitransitive permutation groups
• A bound on permutation codes
• Groups that are transitive on all partitions of a given shape
• Top-heavy phenomena for transformations
• A Chemotaxis System with Logistic Source
• ORBIT-HOMOGENEITY IN PERMUTATION GROUPS
• The classification of partition homogeneous groups with applications to semigroup theory
• Transitivity in finite general linear groups
• Tiling the symmetric group by transpositions

This page was built for publication: A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377398)