A structural characterisation of Av(1324) and new bounds on its growth rate

  title={A structural characterisation of Av(1324) and new bounds on its growth rate},
  author={David Bevan and Robert Brignall and Andrew Elvey Price and Jay Pantone},
  journal={Eur. J. Comb.},
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of 1324-avoiders as a subclass of an infinite staircase grid class, together with precise asymptotics of a small domino subclass whose enumeration we relate to West-two-stack-sortable permutations and planar maps. The bounds are established by carefully combining… 
Moments of permutation statistics and central limit theorems
We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with constant
Combinatorial Specifications for Juxtapositions of Permutation Classes
It is shown that, given a suitable combinatorial specification for a permutation class, one can obtain a specification for the juxtaposition (on either side) of $\mathcal{C}$ with Av(21) or Av(12), and that this process can be iterated, thereby providing an effective method to enumerate any 'skinny' grid class in which at most one cell is non-monotone.
1324-avoiding Permutations Revisited
We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in $14$ further terms of the generating function, which is now known for all patterns of length $\le
Which Schubert Varieties are Hessenberg Varieties?
After proving that every Schubert variety in the full flag variety of a complex reductive group G is a general Hessenberg variety, we show that not all such Schubert varieties are adjoint Hessenberg
Stieltjes moment sequences for pattern-avoiding permutations
It is demonstrated that the density function for the Stieltjes moment sequence Av(123\ldots k) is closely, but non-trivially, related to the density attached to the distance traveled by a walk in the plane with $k-1$ unit steps in random directions.


Permutations avoiding 1324 and patterns in Łukasiewicz paths
  • David Bevan
  • Mathematics, Computer Science
    J. Lond. Math. Soc.
  • 2015
It is proved that the growth rate of the class Av(1324), of permutations avoiding the pattern 1324, exceeds 9.81, which improves on a previous lower bound of 9.47.
Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
It is shown 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 eπ2/3?13, and that if this is true then the Stanley-Wilf limit for 1324 is at most eπ1/2?13.
On the growth of merges and staircases of permutation classes
There is a well-known upper bound on the growth rate of the merge of two permutation classes. Curiously, there is no known merge for which this bound is not achieved. Using staircases of permutation
Some open problems on permutation patterns
This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey
On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
We show that the Stanley-Wilf limit for the class of 4231-avoiding permutations is at least by 9.47. This bound shows that this class has the largest such limit among all classes of permutations
Excluded permutation matrices and the Stanley-Wilf conjecture
This paper examines the extremal problem of how many 1-entries an n × n 0-1 matrix can have that avoids a certain fixed submatrix P and proves a linear bound for any permutation matrix P.
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
  • M. Bóna
  • Computer Science, Mathematics
    J. Comb. Theory, Ser. A
  • 1997
Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating functionH(x) of all 1342-avoiding permutations of lengthnas well as
A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)
Abstract The Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hours of CPU time (of Maple running on Drexel University's Sun network) established Julian West's
On 1324-avoiding permutations
An improved algorithm for counting the number of 1324-avoiding permutations is given, resulting in 5 further terms of the generating function, and compelling evidence is found that unlike other classical length-4 pattern- avoiding permutations, the generatingfunction in this case does not have an algebraic singularity.
Patterns in Permutations and Words
  • S. Kitaev
  • Mathematics, Computer Science
    Monographs in Theoretical Computer Science. An EATCS Series
  • 2011
The author collects the main results in the field in this up-to-date, comprehensive reference volume and highlights significant achievements in the area, and points to research directions and open problems.