Longest increasing subsequences in pattern-restricted permutations

Electronic Journal of Combinatorics

Volumn 9, Issue 2 R, 2003, Pages

  Deutsch, Emeric ^a   Hildebrand, A J ^b   Wilf, Herbert S ^c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042585737     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1684     Document Type: Article

References (18)

1. M. Abramowitz and I. Stegun, Handbook of Mathematical Functions, Dover Publ., New York, 1965.
2. J. Baik, P. Deift and K. Johansson, On the distribution of the length of the longest increasing subsequence of random permutations, J. Amer. Math. Soc. 12 (1999)1119-1178.
3. Jason Bandlow and Kendra Killpatrick, An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations, Elec. J. Combinatorics 8 (2001), #R40.
4. T. Chow and J. West, Forbidden subsequences and Chebyshev polynomials, Discr. Math. 204 (1999), 119-128.
5. De Bruijn, N.G., Knuth, D.E., and Rice, S.O., The average height of planted plane trees, In Graph Theory and Computing (1972), R.C. Read, Ed., Academic Press, 15-22.
6. P. Erdos and G. Szekeres, A combinatorial theorem in geometry, Compositio Math., 2 463-470, (1935).
7. Philippe Flajolet, Xavier Gourdon and Philippe Dumas, Mellin transforms and asymptotics: harmonic sums, 55 pp., see, e.g.,the website of Flajolet.
8. Philippe Flajolet and Andrew Odlyzko, The average height of binary trees and other simple trees, J. Computer and System Sciences 25 (1982), 171-213.
9. Markus Fulmek, Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three, arXiv: math.CO/0112092, Apr. 2002.
10. Mahendra Jani and Robert Rieper, Continued fractions and Catalan problems, Electronic J. Combinatorics 7 (2000), #R45.
11. C. Krattenthaler, Permutations with restricted patterns and Dyck paths, Adv. Appl. Math. 27 (2001), 510-530.
12. B.F.Logan and L.A.Shepp, A variational problem for random Young tableaux, Advances in Math., 26, 206-222, (1977).
13. A.M.Odlyzko and E.M.Rains, On longest increasing subsequences in random permutations, Analysis, geometry, number theory: the mathematics of Leon Ehrenpreis (Philadelphia, PA, 1998), 439-451, Contemp. Math., 251, Amer. Math. Soc., Providence, RI, 2000.
14. Astrid Reifegerste, On the diagram of 132-avoiding permutations, arXiv: math. CO/ 0208006, Aug. 2002.
15. A. Rényi and G. Szekeres, On the height of trees, J. Austral. Math. Soc. 7 (1967), 497-507.
16. B. E. Sagan, The Symmetric Group, 2nd edition, Springer, New York, 2001.
17. C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math., 13, 1961, 179-191.
18. A.M.Vershik and S.V.Kerov, Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tables, Soviet Math. Dokl., 18, 527-531,(1977).