Picture of neon light reading 'Open'

Discover open research at Strathprints as part of International Open Access Week!

23-29 October 2017 is International Open Access Week. The Strathprints institutional repository is a digital archive of Open Access research outputs, all produced by University of Strathclyde researchers.

Explore recent world leading Open Access research content this Open Access Week from across Strathclyde's many research active faculties: Engineering, Science, Humanities, Arts & Social Sciences and Strathclyde Business School.

Explore all Strathclyde Open Access research outputs...

Prolific permutations and permuted packings : downsets containing many large patterns

Bevan, David and Homberger, Cheyne and Tenner, Bridget Eileen (2018) Prolific permutations and permuted packings : downsets containing many large patterns. Journal of Combinatorial Theory Series A, 153. pp. 98-121. ISSN 0097-3165

[img] Text (Bevan-etal-JCTSA-2017-Prolific-permutations-and-permuted-packings)
Bevan_etal_JCTSA_2017_Prolific_permutations_and_permuted_packings.pdf - Accepted Author Manuscript
Restricted to Repository staff only until 11 August 2018.
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (245kB) | Request a copy from the Strathclyde author

Abstract

A permutation of n letters is k-prolific if each (n - k)-subset of the letters in its one-line notation forms a unique pattern. We present a complete characterization of k-prolific permutations for each k, proving that k-prolific permutations of m letters exist for every m >= k^2/2+2k+1, and that none exist of smaller size. Key to these results is a natural bijection between k-prolific permutations and certain "permuted" packings of diamonds.