Permutations all of whose patterns of a given length are distinct

DOI10.1016/J.JCTA.2013.06.006MaRDI QIDQ2349196zbMATH OpenOpenAlexFDO

Authors Peter Hegarty

Publication date 19 June 2015

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.0966

zbMATH Keywords

\(k\)-separatorpermutation patterntilted checkerboard permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation sigma in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + lfloor sqrt{2k-3} floor + e_k, where e_k in {-1,0} for every k. Suggestions for further investigations along these lines are discussed.

Recommendations

• Asymptotic bounds for permutations containing many different patterns
• Permutations containing many patterns
• On the number of permutations avoiding a given pattern
• The maximal length of a k-separator permutation
• Dense packing of patterns in a permutation

Cited in

(7)

• Asymptotic bounds for permutations containing many different patterns
• Permutations with a distinct difference property
• Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization
• Prolific permutations and permuted packings: downsets containing many large patterns
• Permutations containing many patterns
• scientific article; zbMATH DE number 5704239 (Why is no real title available?)
• The maximal length of a k-separator permutation

This page was built for publication: Permutations all of whose patterns of a given length are distinct

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349196)