TY - JOUR

T1 - On Partitioning the Orbitals of a Transitive Permutation Group

AU - Li, Cai-Heng

AU - Praeger, Cheryl

PY - 2002

Y1 - 2002

N2 - Let G be a permutation group on a set Omega with a transitive normal subgroup M. Then G acts on the set Orbl(M, Omega) of nontrivial M-orbitals in the natural way, and here we are interested in the case where Orbl( M,) has a partition P such that G acts transitively on P. The problem of characterising such tuples (M, G, Omega, P), called TODs, arises naturally in permutation group theory, and also occurs in number theory and combinatorics. The case where | P| is a prime-power is important in algebraic number theory in the study of arithmetically exceptional rational polynomials. The case where | P| = 2 exactly corresponds to self-complementary vertex-transitive graphs, while the general case corresponds to a type of isomorphic factorisation of complete graphs, called a homogeneous factorisation. Characterising homogeneous factorisations is an important problem in graph theory with applications to Ramsey theory. This paper develops a framework for the study of TODs, establishes some numerical relations between the parameters involved in TODs, gives some reduction results with respect to the G-actions on Omega and on P, and gives some construction methods for TODs.

AB - Let G be a permutation group on a set Omega with a transitive normal subgroup M. Then G acts on the set Orbl(M, Omega) of nontrivial M-orbitals in the natural way, and here we are interested in the case where Orbl( M,) has a partition P such that G acts transitively on P. The problem of characterising such tuples (M, G, Omega, P), called TODs, arises naturally in permutation group theory, and also occurs in number theory and combinatorics. The case where | P| is a prime-power is important in algebraic number theory in the study of arithmetically exceptional rational polynomials. The case where | P| = 2 exactly corresponds to self-complementary vertex-transitive graphs, while the general case corresponds to a type of isomorphic factorisation of complete graphs, called a homogeneous factorisation. Characterising homogeneous factorisations is an important problem in graph theory with applications to Ramsey theory. This paper develops a framework for the study of TODs, establishes some numerical relations between the parameters involved in TODs, gives some reduction results with respect to the G-actions on Omega and on P, and gives some construction methods for TODs.

U2 - 10.1090/S0002-9947-02-03110-0

DO - 10.1090/S0002-9947-02-03110-0

M3 - Article

SN - 0002-9947

VL - 355

SP - 637

EP - 653

JO - Transactions of the American Mathematical Society

JF - Transactions of the American Mathematical Society

IS - 2

ER -