Fetching the paper…
Reading the bibliography…
Numerical evidence suggests that certain permutation patterns of length k are easier to avoid than any other patterns of that same length.
A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Advances in Mathematics 41
1981
Earlier work this paper cites.
J. West, Permutations with forbidden subsequences; and, Stack sortable permutations, PHD-thesis, Massachusetts Institute of Technology, 1990
1990
Earlier work this paper cites.
R. Arratia, On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern, Electronic J. Combin
1999
Earlier work this paper cites.
M. Bóna, A simple proof for the exponential upper bound for some tenacious patterns. Adv. in Appl. Math. 33 (2004), no. 1, 192–198
2004
Earlier work this paper cites.
A. Marcus, G. Tardos, Excluded Permutation Matrices and the Stanley-Wilf conjecture, J. Combin. Theory Ser. A
2004
Cited alongside, same era.
M. Bóna, The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns. J. Combin. Theory Ser. A
2005
Cited alongside, same era.
M. H. Albert, M. Elder, A. Rechnitzer, P. Westcott, M. Zabrocki, On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia, Adv. in Appl. Math
2006
Cited alongside, same era.
M. Bóna, Records in Stanley-Wilf limits, European J. Combin
2007
Cited alongside, same era.
J. Cibulka, On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture. Journal of Combinatorial Theory, Series A, 116(2):290-302,
Cited in the paper.
P. Flajolet, R. Sedgewick, Analytic Combinatorics
2009
Later among the works it cites.
2011
Later among the works it cites.
M. Bóna, Combinatorics of Permutations
2012
Closest in time.
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…