Skip navigation
Skip navigation

The minimum length of a base for the symmetric group acting on partitions

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]

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
Source: European Journal of Combinatorics
DOI: 10.1016/j.ejc.2006.08.014


File Description SizeFormat Image
01_Benbenishty_The_minimum_length_of_a_base_2007.pdf268.53 kBAdobe PDF    Request a copy
02_Benbenishty_The_minimum_length_of_a_base_2007.pdf233.59 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator