The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class, which consist of permutations with a particularly regular structure, we prove that the growth rate of the class exceeds 9.81. This improves on a previous lower bound of 9.47. Central to our proof is an examination of the asymptotic distributions of certain substructures in the Hasse graphs of the permutations. In this context, we consider occurrences of patterns in Łukasiewicz paths and prove that in the limit they exhibit a concentrated Gaussian distribution
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permu...
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permu...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
We establish a lower bound of 10.271 for the growth rate of the permutations avoiding 1324, and an u...
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
We establish a lower bound of 10.24 for the growth rate of the permutations avoiding 1324, and an up...
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permu...
This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects n...
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards un...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permu...
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permu...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
We establish a lower bound of 10.271 for the growth rate of the permutations avoiding 1324, and an u...
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
We establish a lower bound of 10.24 for the growth rate of the permutations avoiding 1324, and an up...
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerati...
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permu...
This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects n...
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards un...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...