Combinatorics of permutations

Combinatorics of Permutations

Volumn , Issue , 2004, Pages 1-383

  Bóna, Miklós ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84886131408     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (208)

1. W. Aitken, Total Relative Displacement of Permutations. J. Combin. Theory A, 87 (1989), no.1, 1–21.
2. M. H. Albert, R. Aldred, M. D. Atkinson, C. C. Handley, D. A. Holton, Permutations of a multiset avoiding permutations of length 3. European J. Combin., 22 (2001), no. 8, 1021–1031.
3. M. H. Albert, M. D. Atkinson, C. C. Handley, D. A. Holton, W. Stromquist, On packing densities of permutations. Electron. J. Combin., 9 (2002), no. 1.
4. D. Aldous, P. Diaconis, Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc. (N.S.), 36 (1999), no. 4, 413–432.
5. N. Alon, E. Friedgut, On the number of permutations avoiding a given pattern. J. Combin. Theory Ser. A, 89 (2000), no. 1, 133–140.
6. G. Andrews, The Theory of Partitions. Addison-Wesley, Reading MA, 1976.
7. T. Apostol, Introduction to Analytical Number Theory. Springer Verlang, NY, 1976.
8. R. Arratia, On the Stanley-Wilf conjecture for the number of Permutations avoiding a given pattern. Electronic J. Combin., 6 (1999), no. 1, N1.
9. M. D. Atkinson, Permutations which are the union of an increasing and a decreasing subsequence. Electronic J. Combin., 5 (1998), no. 1, R6.
10. M. D. Atkinson, Restricted Permutations. Discrete Math., 195 (1999), no. 1-3, 27–38.
11. M. D. Atkinson, Pop-stacks in parallel. Inform. Process. Lett., 70 (1999) 63–67.
12. M. D. Atkinson, M. M. Murphy, N. Ruskuc, Sorting with two ordered stacks in series. Theoret. Comput. Sci., 289 (2002), no 1., 205–223.
13. D. Avis, M. Newborn, On pop-stacks in series. Utilitas Math., 19 (1981), 129–140.
14. m are Wilf-equivalent. Graphs Combin., 16 (2000), no. 4, 373–380.
15. E. Babson, E. Steingr´“msson, Generalized permutation patterns and a classification of the Mahonian statistics. Séminaire Lotharingien de Combinatoire., 44 (2000).
16. J. Backelin, J. West, G. Xin, Wilf equivalence for singleton classes. Proceedings of the 13th Conference on Formal Power Series and Algebraic Combinatorics, Tempe, AZ, 2001.
17. J. Baik, P. Deift, K. Johansson, On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc., 12 (1999), no. 4, 1119-1178.
18. H. Barcelo, S. Sundaram, On some submodules of the action of the symmetric group on the free Lie algebra. J. Algebra, 154 (1993), no. 1, 12–26.
19. H. Barcelo, R. Maule, S. Sundaram, On counting permutations by pairs of congruence classes of major index. Electron. J. Combin., 9 (2002), no. 1.
20. M. Bayer, P. Diaconis, Trailing the dovetail shuffle to its lair. Ann. Appl. Prob., 2 (1992), no. 2, 294–313.
21. E. Bender, R. Canfield, Log-concavity and related properties of the cycle index polynomials. J. Combin. Theory Ser. A, 74 (1996), no. 1, 57–70.
22. E. A. Bertram, B. Gordon, Counting special permutations. European J. Combin., 10 (1989), no. 3, 221–226.
23. J. S. Beissinger, Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux. Discrete Math., 67 (1987), no. 2, 149–163.
24. A. Björner, F. Brenti, Combinatorics of Coxeter Groups. Springer Verlag, New York, 2004.
25. n. J. Combin. Theory A, 17 (1974), 156–161.
26. E. D. Bolker, A. M. Gleason, Counting permutations. J. Combin. Theory A, 29 (1980), no. 2, 236–242.
27. M. Bóna, A Walk Through Combinatorics. World Scientific, River Edge NJ, 2002.
28. M. Bóna, R. Ehrenborg, Acombinatorial proof of the log-concavity of the numbers of permutations with k runs. J. Combin. Theory A, 90 (2000), no. 2, 293–303.
29. M. Bóna, D. A. Spielman, An infinite antichain of permutations. Electronic J. of Combin., 7 (2000).
30. M. Bóna, A. MacLennan, D. White, Permutations with roots. Random Structures and Algorithms, 17 (2000), no. 2, 157–167.
31. M. Bóna, A combinatorial proof of a result of Hetyei and Reiner on Foata-Strehl-type permutation trees. Ann. Comb., 1 (1997), no. 2, 119– 122.
32. M. Bóna, Exact enumeration of 1342-avoiding permutations; A close link with labeled trees and planar maps. J. Combin. Theory A, 80 (1997), 257–272.
33. M. Bóna, Permutations with one or two 132-subsequences. Discrete Mathematics, 175 (1997), 55–67.
34. M. Bóna, The number of permutations with exactly r 132-subsequences of is P-recursive in the size! Adv. Appl. Math, 18 (1997), 510–522.
35. M. Bóna, The permutation classes equinumerous to the Smooth class. Electronic J. Combin., 5 (1998).
36. M. Bóna, R. Simion, A self-dual poset on objects counted by the Catalan numbers and a type-B analogue. Discrete Mathematics 220 (2000), no. 1-3, 35–49.
37. M. Bóna, B. E. Sagan, V. Vatter, Frequency sequences with no internal zeros. Adv. Appl. Math, 28 (2002), 395-420.
38. M. Bóna A Simplicial Complex of 2-stack sortable permutations. Adv. Appl. Math, 29 (2002), 499-508.
39. M. Bóna Partitions with k crossings. The Ramanujan Journal, 3 (1999), no. 2, 215–220.
40. M. Bóna Permutations avoiding certain patterns; The case of length 4 and generalizations. Discrete Math., 175 (1997), no. 1-3, 55–67.
41. M. Bóna The limit of a Stanley-Wilf sequence is not always an integer, and layered patterns beat monotone patterns. Preprint, available on arXiv, math.CO/0403502, 2004.
42. P. Bose, J. F. Buss, A. Lubiw, Pattern matching for permutations. Inform. Process. Lett., 65 (1998), 277-283.
43. M. Bousquet-Mélou, C. Chauve, G. Labelle, P. Leroux, A bijective proof for the arborescent form of the multivariable Lagrange inversion formula. Mathematics and computer science, (Versailles, 2000), Trends Math., Birkhuser, Basel, 2000, 89–100.
44. M. Bousquet-Mélou, Sorted and/or sortable permutations. Formal power series and algebraic combinatorics (Toronto, ON, 1998). Discrete Math., 225 (2000), no. 1-3, 25–50.
45. M. Bousquet-Mélou, Counting Walks in the Quarter plane. Mathematics and Computer Science: Algorithms, trees, combinatorics and probabilities, Trends in Mathematics, Birkhauser, 2002, 49–67.
46. F. Brenti, Hilbert polynomials in combinatorics. J. Algebraic Combin., 7 (1998), no. 2, 127–156.
47. F. Brenti, Combinatorics and total positivity. J. Combin. Theory A, 71 (1995), no. 2, 175–218.
48. F. Brenti, Permutation enumeration, symmetric functions, and unimodality. Pacific J. Mathematics, 157 (1993), no. 1, 1–28.
49. F. Brenti, Log-concave and unimodal sequences in algebra, combinatorics, and geometry: an update. Jerusalem Combinatorics '93, Contemp. Math. 178 (1994), Amer. Math. Soc., Providence, RI, 71–89.
50. D. Bressoud, D. Zeilberger, Bijecting Euler's partitions-recurrence. American Math. Montly, 92 (1985), no. 1, 54-55.
51. A. Broder, M. Charikar, A. Frieze, M. Mitzenmacher Min-wise independent permutations. 30th Annual ACM Symposium on Theory of Computing (Dallas, TX, 1998). J. Comput. System Sci., 60 (2000), no. 3, 630–659.
52. W. G. Brown, J. W. Tutte, On the enumeration of rooted non-separable planar maps. Canad. J. Math., 16 (1964) 572–577.
53. S. Brunetti, A. DelLungo, F. DelRistoro, A cycle lemma for permutation inversions. Discrete Math., 257 (2002), no. 1, 1–13.
54. L. Butler, The q-log-concavity ofq-binomial coeÆcients. J. Combin. Theory A, 54 (1990), no. 1, 54–63.
55. L. Butler, A unimodality result in the enumeration of subgroups of a finite Abelian group. Proc. Amer. Math. Soc., 101 (1987), vol. 4, 771-775.
56. C. Charalambides, Enumerative Combinatorics. Chapman Hall CRC, Boca Raton, FL, 2002.
57. L. Carlitz, Eulerian numbers and polynomials. Math. Mag., 32 (1958-1959), 247–260.
58. A. Cayley, On the partitions of a polygon. Proc. London Math. Soc., 22 (1890-1891), no. 1, 237–262.
59. J. Y. Choi, J. D. H. Smith, On the unimodality and combinatorics of Bessel numbers. Discrete Math. 264 (2003), no. 1-3, 45–53.
60. A. Claesson, Generalized pattern avoidance. Europ. J. Combinatorics, 22 (2001), no. 7, 961–971.
61. M. Coleman, An (almost) optimal answer to a question by Wilf. Preprint, 2003.
62. L. Comtet, Advanced Combinatorics. The art of finite and infinite expansions. D. Reidel Publishing Co., Dordrecht, The Netherlands, Revised and enlarged edition, 1974.
63. C. Cooper, The union of two random permutations does not have a directed Hamilton cycle. Random Structures Algorithms, 18 (2001), no. 1, 95–98.
64. R. Cori, B. Jacquard, G. Schaeffer Description trees for some families of planar maps. Proceedings of the 9th Conference on Formal Power Series and Algebraic Combinatorics, Vienna, Austria, 1997, 196–208.
65. R. Cori, G. Schaeffer, Description trees and Tutte formulas. Theoret. Comput. Sci, 292 (2003), no. 1, 165–183.
66. J. N. Darroch, On the distribution number of successes in independent trials. Ann. Math. Stat., 35 (1964), 1317–1321.
67. F. N. David, D. E. Barton, Combinatorial Chance. Charles GriÆn and Company, Ltd. London, UK, 1962.
68. R. S. Deodhar, M. K. Srinivasan A statistic on involutions. J. Algebraic Combin., 13 (2001), 187–198.
69. J. Dénes, The representation of a permutation as the product of a minimal number of transpositions, and its connection with the theory of graphs. A Magyar Tudományos Akadémia Matematikai Intézetének közleményei [Communications of the Mathematical Institute of the Hungarian Academy of Sciences], 4 (1959), 63–70.
70. J. Désarmenien, Une autre interprétation du nombre de dérangements. Sém. Lotharing. Combin., 19 (1984), 11-16.
71. J. Désarmenien, D. Foata, The signed Eulerian numbers. Discrete Math., 99 (1992) no. 1-3, 49–58.
72. J. Désarmenien, M. Wachs, Descentes des dérangements et mots circulaires. Sém. Lotharing. Combin., 19, 13–21, 1984.
73. J. Désarmenien, M. Wachs, Descent classes on permutations. J. Combin. Theory A, 64 (1993), no. 2, 311–328.
74. E. Deutsch, A. J. Hildebrand, H. S. Wilf, Longest increasing subsequences in pattern-restricted permutations. Electronic J. Combin., 9 (2003), R12.
75. E. Deutsch, A. Robertson, D. Saracino, Refined restricted involutions. European J. Combinatorics, to appear.
76. P. Diaconis, M. MacGrath, J. Pitman, Riffle shuffles, cycles, and descents. Combinatorica, 15 (1995), no. 1, 11–29.
77. S. Dulucq, S. Gire, J. West Permutations with forbidden subsequences and nonseparable planar maps. Discrete Math., 153 (1996), no. 1-3, 85–103.
78. P. H. Edelman, Inversions and cycles in permutations. Europ. J. Combinatorics, 8 (1987), 269–279.
79. n. Combinatorics and algebra (Boulder, Colo., 1983), Contemp. Math., 34 (1984), Amer. Math. Soc., Providence, RI, 155–162.
80. P. H. Edelman, C. Greene, Balanced tableaux. Adv. in Math., 63 (1987), no. 1 42–99.
81. P. H. Edelman, V. Reiner, H-shellings and h-complexes. Adv. Math., 106 (1994), no. 1, 36–64.
82. E. Egge, Restricted Permutations related to Fibonacci numbers and k-generalized Fibonacci numbers. Preprint, arXiv;math.CO/0109219.
83. S. Effler, F. Ruskey, ACAT algorithm for generating permutations with a fixed numberofinversions. Inform. Process. Lett., 86 (2003), no. 2, 107–112.
84. P. Erdos, On a conjecture of Hammersley. J. London Math. Soc., 28 (1953), 232–236.
85. H. Eriksson, K. Eriksson, S. Linusson, J. Wästlund, Dense packing of patterns in a permutation. Proceedings of the 14th FPSAC, Melbourne, Australia, 2002.
86. P. Flajolet, Analytic Models and Ambiguity ofContext-free Languages. Theoret. Comput. Sci., 49 (1987), 282–309.
87. D. Foata, On the Netto inversion number of a sequence. Proc. Amer. Math. Soc., 19 (1968), no. 1, 236–240.
88. D. Foata, Distributions Eulériennes et Mahoniennes sur le groupe des permutations. in Higher Combinatorics, Martin Aigner, editor, D. Reidel, Dordrecht, The Netherlands, 1977.
89. D. Foata, M. P. Schützenberger, Théorie Geometrique des Polynomes Eulériens. in Lecture Notes in Mathematics, 138 (1970), Springer-Verlag, Berlin, Germany.
90. D. Foata, M. P. Schützenberger, Major index and inversion number of permutations. Math. Nachr., 83 (1978), 143–159.
91. D. Foata, D. Zeilberger, Denert's permutation statistic is indeed Euler-Mahonian. Stud. Appl. Math., 83 (1990), 31–59.
92. S. Fomin, Finite, partially ordered sets and Young diagrams. (Russian) Dokl. Akad. Nauk SSSR, 243 (1978), no. 5, 1144–1147.
93. H. O. Foulkes, A nonrecursive rule for Eulerian numbers. J. Combin. Theory Ser. A, 22 (1977), no. 2, 246-248.
94. A. Frank, On chain and antichain families of a partially ordered set. J. Combin. Theory Ser. B, 29 (1980), no. 2 176–184.
95. A. Frieze, Hamilton cycles in the union of random permutations. Random Structures Algorithms, 18 (2001), no. 1, 83–94.
96. G. Frobenius, Über die Charaktere der symmetrischen Gruppe. Preuss. Akad. Wiss. Sitz., 1900, 516–534.
97. G. Frobenius, Über die charakteristischen Einheiten der symmetrischen Gruppe. Preuss. Akad. Wiss. Sitz., 1903, 328–358.
98. G. Frobenius, Über die Bernoullischen Zahlen and die Eulerischen Polynome. Sits. Ber. Preuss. Akad. Wiss., 1910, 808–847.
99. M. Fulmek, Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three. Adv. in Appl. Math., 30 (2003), no. 4, 607–632.
100. W. Fulton, Young tableaux. With applications to representation theory and geometry. London Mathematical Society Student Texts, 35 (1997), Cambridge University Press, Cambridge, 1997.
101. Z. Füredi, P. Hajnal, Davenport-Schinzel theory of matrices. Discrete Math., 103 (1992), 233–251.
102. A. Garsia, S. Milne A Rogers-Ramanujan bijection. J. Combin. Theory Ser. A, 31 (1981), 289–339.
103. V. Gasharov On the Neggers-Stanley conjecture and the Eulerian polynomials, J. Combin. Theory Ser. A, 82 (1998), no. 2, 134–146.
104. I. Gessel, Personal communication, 1997.
105. I. Gessel, Symmetric functions and P-recursiveness. J. Combin. Theory Ser. A, 53 (1990), no. 2, 257–285.
106. I. Gessel, G. Labelle, Lagrange inversion for species. J. Combin. Theory Ser. A, 72 (1995), no. 1, 95–117.
107. I. Gessel, C. Reutenauer, Counting permutations with given cycle structure and descent set.J. Combin. Theory Ser. A, 64 (1984), 189-215.
108. I. Gessel, R. Stanley, Stirling polynomials. J. Combin. Theory Ser. A, 24 (1978), 24–33.
109. I. Gessel, Counting forests by descents and leaves. Electronic J. Combin., 3 (1996), no. 2, R8.
110. S. Gire, Arbres, permutations a motifs exclus et cartes planaires: quelque problemes algorithmiques et combinatoires. Ph.D thesis, University Bordeaux I, 1993.
111. D. Gouyou-Beauchamps, Standard Young tableaux of height 4 and 5. European J. Combin., 10 (1989), no. 1, 69–82.
112. H. Gordon, Discrete probability. Undergraduate Texts in Mathematics, 1997, Springer-Verlag, New York.
113. C. Greene An extension of Schensted's theorem. Advances in Math., 14 (1974), 254–265.
114. C. Greene, D. Kleitman, The structure of Sperner k-families. J. Combinatorial Theory Ser. A, 20 (1976), 41–68.
115. C. Greene, A. Nijenhuis, H. S. Wilf, A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. in Math., 31 (1979), no. 1, 104–109.
116. C. Greene, A. Nijenhuis, H. S. Wilf, Another probabilistic method in the theory of Young tableaux. J. Combin. Theory Ser. A, 37 (1984), no. 2, 127–135.
117. H. W. Gould, Evaluation of sums of convolved powers using Stirling and Eulerian numbers. Fibonacci Quart., 16 (1978), no. 6, 488–497.
118. I. P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations. J. Combin. Theory Ser. A, 75 (1996), no. 2, 220–242.
119. O. Guibert, T. Mansour, Restricted 132-involutions and Chebysev polynomials. Preprint.
120. O. Guibert, Combinatoire des permutations a motifsexclus en liason avec des mots, cartes planaires, et Tableaux de Young. Ph.D thesis, University Bordeaux I, 1995.
121. O. Guibert, R. Pinzani, E. Pergola, Vexillary involutions are enumerated by Motzkin numbers. Ann. Comb., 5 (2001), no. 2, 153–174.
122. M. Haiman, Smooth Schubert varieties. Preprint.
123. J. Hammersley, A few seedlings of research. Proc. Sixth Berkeley Simp. Math. Statist. and Probability, Volume 1, 345-394, University of California Press, 1972.
124. P. Hästö, On descents in Standard Young Tableaux. Electronic J. Combin, 7 (2000), R59.
125. G. Hetyei, E. Reiner, Permutation trees and variation statistics. European J. Combin., 19 (1998), no. 7, 847–866.
126. D. M. Jackson, R.C. Read, A note on permutations without runs of given length. Aequationes Mathematicae, 17 (1978), 336–343.
127. A. D. Jaggard, Prefix exchanging and pattern avoidance by involutions. Elec. J. Combin., 9 (2003). no. 2, R16, 2003.
128. S. M. Johnson, Generation of permutations by adjacent transpositions. Mathematics of Computation, 17 (2003), 282–285.
129. C. Jordan, Calculus of Finite Differences. Chelsea, New York, NY, 2nd edition, 1960.
130. T. Kaiser, M. Klazar, On growth rates of hereditary permutation classes, Electr. J. Combinatorics 9 (2003), vol. 2, R10.
131. M. Klazar, A general upper bound in extremal theory of sequences. Comment. Math. Univ. Carolin., 33 (1992), 737–746.
132. M. Klazar, P. Valtr, Generalized Davenport-Schinzel sequences. Combinatorica 14 (1994), 463–476.
133. M. Klazar, The Füredi-Hajnal conjecture implies the Stanley-Wilf conjecture. Formal Power Series and Algebraic Combinatorics, Springer Verlag, Berlin, Germany, 2000, 250–255.
134. 3-conjecture for solvable groups. Israel J. Math., 91 (1995), no. 1-3, 61–76.
135. D. E. Knuth, Permutations, matrices, and generalized Young tableaux. Pacific J. Math., 34 (1970), 709–727.
136. D. E. Knuth, The art of computer programming. Volume 3 Addison-Wesley Publishing Co., Reading MA, 1973.
137. C. Krattenthaler, The enumeration of lattice paths with respect to their number of turns. Advances in Combinatorial Methods and Applications to Probability and Statistics, N. Balakrishnan, ed., Birkhuser, Boston, 1997, 29–58.
138. D. Kremer, Permutations with forbidden subsequences and a generalized Schröder number. Discrete Mathematics, 218 (2000), no. 1-3, 121–130.
139. D. Kremer, W. C. Shiu, Finite transition matrices for permutations avoiding pairs of length four patterns. Discrete Mathematics, 268 (2003), no. 1-3, 171–183.
140. G. Kreweras, Une famille de polynomes ayant plusieurs propriétés énumeratives. Period. Math. Hungar., 11 (1980), no. 4, 309–320.
141. G. Kreweras, Sur une classe des problemes liés au treillis des partitions d'entiers. Cahiers du B.U.R.O, 6 (1965), 5–105.
142. G. Labelle, Une nouvelle démonstration combinatoire des formules d'inversion de Lagrange. Adv. in Math., 42 (1981), no. 1, 217–247.
143. R. Laver, Well-quasi orderings and sets of finite sequences. Math. Proc. of the Cambr. Philos. Soc. 79 (1976), 1–10.
144. N. Linial, Graph coloring and monotone functions on posets. Discrete Math. 58 (1986), 97–98.
145. B. F. Logan, L. A Schepp, A variational problem for random Young tableaux. Advances in Math. 26 (1977), no. 2, 206–222.
146. L. Lovász, Combinatorial Problems and Exercises. Second edition, North Holland, Amsterdam, 1994.
147. P. MacMahon, Two applications of general theorems in combinatory analysis. Proc. London Math. Soc. 15 (1916), 314–321.
148. T. Mansour, A. Vainshtein, Counting Occurrences of 132 in a Permutation. Adv. Appl. Math., 28 (2002), no. 2, 185-195.
149. A. Marcus, G. Tardos, Excluded Permutation Matrices and the Stanley-Wilf conjecture. J. Combin. Theory Ser. A, to appear.
150. P. Moszkowski, AsolutiontoaproblemofDénes: a bijection between trees and factorizations of cyclic permutations. Europ. J. Combinatorics, 10 (1989), no. 1, 13–16.
151. E. Netto, Lehrbuch der Combinatorik. Chelsea, New York, NY, 1901.
152. J. Noonan, The number of permutations containing exactly one increasing subsequence of length three. Discrete Math., 152 (1996), no. 1-3, 307–313.
153. J. Noonan, D. Zeilberger The enumeration of permutations with a prescribed number of "forbidden" patterns. Adv. in Appl. Math., 17 (1996), no. 4, 381–407.
154. J. C. Novelli, I. Pak, A. Stoyanovskii, A direct bijective proof of the hook-length formula. Discrete Math. Theor. Comput. Sci., 1 (1997), no. 1, 53–67.
155. K. O'Hara, Unimodality of Gaussian coeÆcients: a constructive proof. J. Combin. Theory A, 53 (1990), no. 1, 29–52.
156. J. Pitman, Probabilistic bounds on the Coecients of Polynomials with only real zeros. J. Combin. Theory A, 77 (1997), no. 2, 279–303.
157. V. R. Pratt, Computing permutations with double-ended queues, parallel stacks and parallel queues. Proc. ACM Symp. Theory of Computing 5 (1973), 268–277.
158. A. Price, Packing Densities of Layered Patterns. Ph. D. Thesis, University ofPennsylvania, 1997.
159. R. Proctor, Solution of two diffcult combinatorial problems with linear algebra. Amer. Math. Monthly, 89 (1982), no. 10, 721–734.
160. D. Rawlings, The r-Major index. J. Combin. Theory A, 31 (1981), no. 2, 175–183.
161. A. Regev, Asymptotic values for degrees associated with strips of Young diagrams. Advances in Mathematics, 41 (1981), 115–136.
162. A. Reifegerste, On the diagram of Schröder permutations. Electronic J. Combin, 9 (2003), no. 2, R8.
163. A. Reifegerste, On the diagram of 132-avoiding permutations European J. Combin, 24 (2003), no. 6, 759–776.
164. J. Remmel, A note on a recursion for the number of derangements. European J. Combin., 4 (1984), no. 4, 371–374.
165. A. Robertson, D. Saracino, D. Zeilberger Refined restricted permutations. Annals of Combinatorics, 6 (2003), 427–444.
166. B. E. Sagan, Inductive and injective proofs of log concavity results. Discrete Math., 68 (1998), no. 2-3,281–292.
167. B. E. Sagan, The Symmetric Group Springer Verlag, New York, NY, 2001, second edition.
168. C. Schensted, Longest increasing and decreasing Subsequences. Canad. J. Math., 13 (1961), 179–191.
169. M. P. Schützenberger, Quelques remarques sur une construction de Schensted. Math. Scand., 12 (1963), 117–128.
170. O. Schlömilch, Recherches sur les coeffcients des facultés analytiques. Crelle 44 (1852), 344–355.
171. R. Simion, F. W. Schmidt, Restricted permutations. European Journal of Combinatorics, 6 (1985), 383–406.
172. M. Skandera, An Eulerian partner for inversions. Sém. Lothar. Combin., 46 2001, B46.
173. R. Smith, Comparing algorithms for sorting with t stacks in series Annals of Combinatorics, to appear.
174. Z. Stankova, Forbidden subsequences. Discrete Math., 132 (1994), no. 1-3, 291–316.
175. Z. Stankova, J. West, A new class of Wilf-equivalent permutations. J. Algebraic Combin., 15 (2002), no. 3, 271–290.
176. R. Stanley, Log-concave and unimodal sequences in algebra, combinatorics, and geometry. Graph Theory and Its Applications: East and West. Ann. NY Acad. Sci. 576 (1989), 500–535.
177. R. Stanley, Differentiably finite power series. European J. Combin., 1 (1980), 175–188.
178. R. Stanley, On the number of reduced decompositions of elements of Coxeter groups. European J. Combin., 5 (1984), no. 4, 359–372.
179. R. Stanley, Enumerative Combinatorics, Volume 1. Cambridge University Press, Cambridge UK, second edition 1997.
180. R. Stanley, Enumerative Combinatorics, Volume 2. Cambridge University Press, Cambridge UK, 1999.
181. R. Stanley, Eulerian Partitions of a unit hypercube. in Higher Combinatorics, Martin Aigner, editor, D. Reidel, Dordrecht, The Netherlands, 1977.
182. R. Stanley, Polygon dissections and standard Young tableaux. J. Combin. Theory Ser. A, 76 (1996), no. 2, 175–177.
183. D. Stanton, Unimodality andYoung's lattice. J. Combin. Theory Ser. A, 54 (1990), no. 1, 41–53.
184. V. Strehl, Symmetric Eulerian distributions for involutions Actes2e Seminaire Lotharingien de Combinatoire, Premiere Session, Publ. 140/S-02, IRMA, Strasbourg, 1981, 12.
185. V. Strehl, Inversions in 2-ordered permutations—a bijective counting. Bayreuth. Math. Schr., 28 (1989), 127–138.
186. L. Takács, A generalization of the Eulerian numbers. Publ. Math. Debrecen, 26 (1979), no. 3-4, 173–181.
187. S. Tanimoto, An operator on permutations and its application to Eulerian numbers. Europ. J. Combinatorics, 22 (2001), no. 4, 569–576.
188. R. E. Tarjan, Sorting using networks of queues and stacks. J. Assoc. Comput. Mach, 19 (1972), 341–346.
189. I. Tomescu, Graphical Eulerian numbers and chromatic generating functions. Discrete Math., 66 (1987), 315–318.
190. H. F. Trotter, Algorithm 115. Comm. Assoc. Comput. Mach 5 (1962), 434–435.
191. J. W. Tutte, A census of planar maps. Canadian Journal of Mathematics 33, 249-271, 1963.
192. V. R. Vatter, Permutations avoiding two patterns of length three. Electronic J. Combin 9 (2003), no. 2, R6.
193. A. M. Vershik, S. V. Kerov, Asymptotic behavior of the Plancherel measure of the symmetric group and the limit form of Young tableaux. Dokl. Akad. Nauk SSSR 233 (1977), no. 6, 1024–1027, 1977. (Russian, English translation: Soviet Math. Dokl. 233 (1977), no. 1-6, 527–531.
194. X. G. Viennot, Une forme gomtrique de la correspondance de Robinson-Schensted. Combinatoire et reprsentation du groupe symtrique (Actes Table Ronde CNRS, Univ. Louis-Pasteur Strasbourg, Strasbourg, 1976), 29–58. Lecture Notes in Math., Vol. 579, Springer, Berlin, 1977.
195. M. Wachs, An involution for signed Eulerian numbers. Discrete Math., 99 (1992), no. 1-3, 59–62.
196. J. West, Permutations with forbidden subsequences; and, Stack sortable permutations. PHD-thesis, Massachusetts Institute of Technology, 1990.
197. J. West, Generating trees and the Catalan and Schröder numbers. Discrete Math., 146 (1995), no. 1-3, 247–262.
198. J. West, Generating trees and forbidden subsequences. Discrete Math., 157 (1996), no. 1-3, 363–374.
199. H. S. Wilf, A bijection in the theory of derangements. Mathematics Magazine, 57 (1984), no. 1, 37–40.
200. H. S. Wilf, Ascending subsequences of permutations and the shapes of tableaux. J. Combin. Theory Ser. A, 60 (1992), no. 1, 155–157.
201. H. S. Wilf, Real zeroes of polynomials that count runs and descending runs. Unpublished manuscript, 1998.
202. P. Winkler, Random orders of dimension 2. Order 7 (1991), 329–339.
203. L. Yen, A note on multiset permutations. SIAM J. Discrete Math. 7 (1994), no. 1, 152–155.
204. A. Young, On quantitative substitutional analysis II. Proc. London. Math. Soc. 34 (1902), no. 1, 361–397.
205. D. Zeilberger, Kathy O Hara's constructive proof of the unimodality of the Gaussian polynomials. Amer. Math. Monthly, 96 (1990), no. 7, 590–602.
206. D. Zeilberger, A holonomic systems approach to special functions identities. J. Computational and Applied Mathematics, 32 (1990), no. 3, 321–368.
207. D. Zeilberger, A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length n is 2(3n)!=((n+1)!(2n+1)!). Discrete Math., 102 (1992), no. 1, 85–93.
208. J. P. Zhang, Finite groups with many conjugate elements. J. Algebra, 170 (1994), no. 2, 608–624.