论文信息 - A New Upper Bound for 1324-Avoiding Permutations

A New Upper Bound for 1324-Avoiding Permutations

We prove that the number of 1324-avoiding permutations of length n is less than $(7+4\sqrt{3})^n$ . The novelty of our method is that we injectively encode such permutations by a pair of words of length n over a finite alphabet that avoid a given factor.

Miklós Bóna

[1] Miklós Bóna. New records in Stanley-Wilf limits , 2007, Eur. J. Comb..

[2] Vít Jelínek,et al. Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns , 2011, J. Comb. Theory A.

[3] P. Flajolet,et al. Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[4] Gábor Tardos,et al. Excluded permutation matrices and the Stanley-Wilf conjecture , 2004, J. Comb. Theory, Ser. A.

[5] Richard Arratia,et al. On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern , 1999, Electron. J. Comb..

[6] M. Zabrocki,et al. On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia , 2006, Adv. Appl. Math..

[7] Miklós Bóna,et al. Combinatorics of permutations , 2022, SIGA.

[8] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .

[9] Mike D. Atkinson,et al. Restricted permutations , 1999, Discret. Math..

[10] Miklós Bóna. Combinatorics of Permutations, Second Edition , 2012, Discrete mathematics and its applications.