Benbenishty, Carmit; Cohen, Jonathan; Niemeyer, Alice
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...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.