Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424483 | Journal of Combinatorial Theory, Series A | 2012 | 12 Pages |
Abstract
We prove that the Stanley-Wilf limit of any layered permutation pattern of length â is at most 4â2, and that the Stanley-Wilf limit of the pattern 1324 is at most 16. These bounds follow from a more general result showing that a permutation avoiding a pattern of a special form is a merge of two permutations, each of which avoids a smaller pattern.We also conjecture that, for any k⩾0, the set of 1324-avoiding permutations with k inversions contains at least as many permutations of length n+1 as those of length n. We show that if this is true then the Stanley-Wilf limit for 1324 is at most eÏ2/3â13.001954.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Anders Claesson, VÃt JelÃnek, Einar SteingrÃmsson,