Abstract
A base for a permutation group, G, is a sequence of elements of its permutation domain whose stabiliser in G is trivial. Using purely elementary and constructive methods, we obtain bounds on the minimum length of a base for the action of the symmetric group on partitions of a set into blocks of equal size. This upper bound is a constant when the size of each block is at most equal to the number of blocks and logarithmic in the size of a block otherwise. These bounds are asymptotically best possible.
Original language | English |
---|---|
Pages (from-to) | 1575-1581 |
Number of pages | 7 |
Journal | European Journal of Combinatorics |
Volume | 28 |
Issue number | 6 |
DOIs | |
Publication status | Published - Aug 2007 |
Externally published | Yes |