Premium
The Minimal Base Size of Primitive Solvable Permutation Groups
Author(s) -
Seress Ákos
Publication year - 1996
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/53.2.243
Subject(s) - cyclic permutation , base (topology) , partial permutation , permutation (music) , primitive permutation group , combinatorics , mathematics , permutation group , pointwise , permutation graph , sequence (biology) , generalized permutation matrix , bit reversal permutation , discrete mathematics , symmetric group , biology , genetics , physics , graph , mathematical analysis , acoustics
A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. Answering a question of Pyber, we prove that all primitive solvable permutation groups have a base of size at most four.