PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188
暂无分享,去创建一个
[1] Michael H. Albert,et al. On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation , 2005, Random Struct. Algorithms.
[2] Martin Klazar,et al. Overview of some general results in combinatorial enumeration , 2008, 0803.4292.
[3] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[4] P. Flajolet,et al. Analytic Combinatorics: RANDOM STRUCTURES , 2009 .
[5] Richard Arratia,et al. On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern , 1999, Electron. J. Comb..
[6] Martin Klazar,et al. On Growth Rates of Closed Permutation Classes , 2003, Electron. J. Comb..
[7] Gábor Tardos,et al. Excluded permutation matrices and the Stanley-Wilf conjecture , 2004, J. Comb. Theory, Ser. A.
[8] Béla Bollobás. Surveys in Combinatorics 2007: Hereditary and monotone properties of combinatorial structures , 2007 .
[9] Robert Morris,et al. Hereditary Properties of Ordered Graphs , 2006 .
[10] Vincent Vatter. Small permutation classes , 2007, 0712.4006.
[11] Toufik Mansour,et al. Packing Patterns into Words , 2002, Electron. J. Comb..
[12] Mike D. Atkinson,et al. Simple permutations and pattern restricted permutations , 2005, Discret. Math..
[13] M. H. ALBERT,et al. Growing at a Perfect Speed , 2009, Comb. Probab. Comput..