A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS

DOI10.1112/S0024610705022441zbMATH Open1089.05079arXivmath/0206163OpenAlexW2158275659MaRDI QIDQ3377398FDOQ3377398

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)

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.

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

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

zbMATH Keywords

partitiondesignassociation schemepermutation groupsymmetric groupYoung subgrouppermutation setordered set partitiontabloid\(t\)-homogeneous\(t\)-transitive

Mathematics Subject Classification ID

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

Cited In (15)

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

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)