On growth rates of closed permutation classes

Electronic Journal of Combinatorics

Volumn 9, Issue 2 R, 2003, Pages

  Kaiser, Tomáŝ ^a,b   Klazar, Martin ^b  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042622480     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1682     Document Type: Article

References (35)

1. R. M. Adin and Y. Roichman, Shape avoiding permutations, J. Comb. Theory, Ser. A, 97 (2002), 162-176.
2. M. H. Albert, M. D. Atkinson, C. C. Handley, D. A. Holton and W. Stromquist, On packing densities of permutations, Electr. J. Comb., 9 (2002), R5, 20 pages.
3. N. Alon and E. Friedgut, On the number of permutations avoiding a given pattern, J. Comb. Theory, Ser. A, 89 (2000), 133-140.
4. R. Arratia, On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern, Electr. J. Comb., 6 (1999), N1, 4 pages.
5. M. D. Atkinson, Restricted permutations, Discrete Math., 195 (1999), 27-38.
6. M. D. Atkinson and R. Beals, Finiteness conditions on closed classes of permutations, unpublished manuscript, 1998.
7. M. D. Atkinson, M. M. Murphy and N. Ruŝkuc, Partially well-ordered sets of permutations, Order, 19 (2002), 101-113.
8. J. Balogh, B. Bollobás and D. Weinreich, The speed of hereditary properties of graphs, J. Comb. Theory, Ser. B, 79 (2000), 131-156.
9. J. Balogh, B. Bollobás and D. Weinreich, The penultimate rate of growth for graph properties, Eur. J. Comb., 22 (2001), 277-289.
10. J. Balogh, B. Bollobás and D. Weinreich, Measures on monotone properties of graphs, Discrete Appl. Math., 116 (2002), 17-36.
11. M. Bóna, Exact and asymptotic enumeration of permutations with subsequence conditions, Ph.D. thesis, M.I.T, 1997.
12. M. Bóna, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Comb. Theory, Ser. A, 80 (1997), 257-272.
13. M. Bóna, Permutations avoiding certain patterns: the case of length 4 and some generalizations, Discrete Math., 175 (1997), 55-67.
14. M. Bóna, The solution of a conjecture of Stanley and Wilf for all layered patterns, J. Comb. Theory, Ser. A, 85 (1999), 96-104.
15. H. Davenport and A. Schinzel, A combinatorial problem connected with differential equations, Amer. J. Math., 87 (1965), 684-694.
16. E. S. Egge, Restricted permutations related to Fibonacci numbers and k-generalized Fibonacci numbers, preprint arXiv:math.CO/0109219, 2001.
17. E. S. Egge and T. Mansour, Restricted permutations, Fibonacci numbers, and k-generalized Fibonacci numbers, preprint arXiv:math.CO/0203226, 2002.
18. T. A. Jenkyns and C. St. J. A. Nash-Williams, Counterexamples in the theory of well-quasi-ordered sets, Proof Techniques in Graph Theory, Proc. 2nd Ann Arbor Graph Theory Conference, 1968 , Academic Press, New York 1969; pp. 87-91.
19. M. Klazar, Counting pattern-free set partitions I: A generalization of Stirling numbers of the second kind, Eur. J. Comb., 21 (2000), 367-378.
20. M. Klazar, The Füredi-Hajnal conjecture implies the Stanley-Wilf conjecture, Proc. 12th international conference FPSAC'00, Moscow, 2000 , Springer, Berlin 2000; pp. 250-255.
21. M. Klazar, Counting pattern-free set partitions III: Growth rates of the hereditary classes, in preparation.
22. J. B. Kruskal, The theory of well-quasi-ordering: A frequently discovered concept, J. Comb. Theory, Ser. A, 13 (1972), 297-305.
23. R. Laver, Well-quasi-orderings and sets of finite sequences, Math. Proc. Camb. Philos. Soc., 79 (1976), 1-10.
24. L. Lovász, Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest 1979.
25. C. St. J. A. Nash-Williams, On well-quasi-ordering finite trees, Proc. Camb. Philos. Soc., 59 (1963), 833-835.
26. V. R. Pratt, Computing permutations with double-ended queues, parallel stacks, and parallel queues, Proc. 5th Annual ACM Symposium on Theory of Computing, Assoc. Comput. Mach., New York 1973; pp. 268-277.
27. A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. Math., 41 (1981), 115-136.
28. E. R. Scheinerman and J. Zito, On the size of hereditary classes of graphs, J. Comb. Theory, Ser. B, 61 (1994), 16-39.
29. D. Spielman and M. Bóna, An infinite antichain of permutations, Electr. J. Comb., 7 (2000), N2, 4 pages.
30. Z. Stankova-Frenkel and J. West, A new class of Wilf-equivalent permutations, J. Algebraic Combin., 15 (2002), 271-290.
31. R. P. Stanley, Enumerative Combinatorics, Volume 1, Wadsworth & Brooks/Cole, Monterey, Ca 1986.
32. R. E. Tarjan, Sorting using networks of queues and stacks, J. Assoc. Comput. Mach., 19 (1972), 341-346.
33. P. Valtr, private communication, January 2000.
34. J. West, Generating trees and forbidden sequences, Dicrete Math., 157 (1996), 363-374.
35. H. S. Wilf, The patterns of permutations, Discrete Math., 257 (2002), 575-583.