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

Carmit Benbenishty*, Jonathan A. Cohen, Alice C. Niemeyer

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

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 languageEnglish
Pages (from-to)1575-1581
Number of pages7
JournalEuropean Journal of Combinatorics
Volume28
Issue number6
DOIs
Publication statusPublished - Aug 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'The minimum length of a base for the symmetric group acting on partitions'. Together they form a unique fingerprint.

Cite this