The maximal length of a \(k\)-separator permutation

zbMath1300.05013MaRDI QIDQ405306

Benjamin Gunby

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p19

zbMATH Keywords

permutationspattern containment

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20)

Related Items (2)

Prolific permutations and permuted packings: downsets containing many large patterns ⋮ Modified Galerkin Method for the Second Order Equation of Mixed Type and Estimate of Its Error

Cites Work

• Unnamed Item
• Asymptotic bounds for permutations containing many different patterns
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Permutations all of whose patterns of a given length are distinct

This page was built for publication: The maximal length of a \(k\)-separator permutation