arXiv Analytics

Sign in

arXiv:1406.2890 [math.CO]AbstractReferencesReviewsResources

Permutations avoiding 1324 and patterns in Ɓukasiewicz paths

David Bevan

Published 2014-06-11, updated 2015-01-08Version 2

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 {\L}ukasiewicz paths and prove that in the limit they exhibit a concentrated Gaussian distribution.

Related articles: Most relevant | Search more
arXiv:1108.0989 [math.CO] (Published 2011-08-04)
The enumeration of permutations avoiding 2143 and 4231
arXiv:1203.1636 [math.CO] (Published 2012-03-07)
The most and the least avoided consecutive patterns
arXiv:1309.0832 [math.CO] (Published 2013-09-03, updated 2015-02-11)
The Enumeration of Permutations Avoiding 3124 and 4312