Maximal chains of subwords and up-down sequences of permutations

Journal of Combinatorial Theory, Series A - Tập 34 - Trang 1-14 - 1983
Gérard Viennot1
1University of California, San Diego, Department of Mathematics, La Jolla, California 92093 USA

Tài liệu tham khảo

Carlitz, 1969, Generating functions, Fibonacci Quart., 7, 359 Carlitz, 1965, The coefficients in an asymptotic expansion, 16, 248 Carlitz, 1973, Permutations with prescribed pattern, Math. Nachr., 58, 31, 10.1002/mana.19730580104 Carlitz, 1976, Some numbers related to the Stirling numbers of the first and second kind, Publ. Univ. Belgrade, 49 Carlitz, 1978, A note on q-Eulerian numbers, J. Combin. Theory Ser. A, 25, 90, 10.1016/0097-3165(78)90038-9 Foata, 1971 Foata, 1973, 173 Foata, 1974, Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers, Math. Z., 137, 257, 10.1007/BF01237393 Foata, 1976, Euler numbers and variations of permutations, Vol. I, 119 Foulkes, 1976, Enumeration of permutations with prescribed up-down and inversion sequences, Discrete Maths., 15, 235, 10.1016/0012-365X(76)90028-5 Foulkes, 1977, A nonrecursive rule for Eulerian numbers, J. Combin. Theory Ser. A, 22, 246, 10.1016/0097-3165(77)90055-3 Françon, 1976, Arbres binaires de recherche: propriétés combinatoires et applications, RAIRO Inform. Théor., 10, 35 Françon, 1978, Description et analyse d'une représentation performante des files de priorités, Publication Math. d'Orsay, 1978, no 12, Département d'Informatique, 91405, Orsay, France. Summary, 1 Gansner, 1977, A characterization of permutations via skew-hook, J. Combin. Theory Ser. A, 23, 176, 10.1016/0097-3165(77)90038-3 Gessel, 1978 Gessel, 1978, Stirling polynomials, J. Combin. Theory Ser. A, 24, 24, 10.1016/0097-3165(78)90042-0 Haines, 1969, On free monoids partially ordered by imbedding, J. Combin. Theory Ser. A, 6, 94, 10.1016/S0021-9800(69)80111-0 Julien, 1968, Sur un théorème d'extension dans la théorie des mots, C. R. Acad. Sci. Paris Ser. A, 266, 851 MacMahon, 1916 Niven, 1968, A combinatorial problem of finite sequences, Nieuw Arch. Wisk., 16, 116 Riordan, 1976, The blossoming of Schröder's fourth problem, Acta Math., 137, 1, 10.1007/BF02392410 Rota, 1964, Theory of Möbius functions, Z. Wahrsch. Verw. Gebiete, 2, 340, 10.1007/BF00531932 Shyr, 1974, Hypercodes, Inform. and Control, 24, 45, 10.1016/S0019-9958(74)80022-7 Viennot, 1976, Quelques algorithmes de permutations, 275 Viennot, 1979, Permutations ayant une forme donnée, Discrete Math., 26, 279, 10.1016/0012-365X(79)90035-9 Viennot, 1980, Une interprétation combinatoire des coefficients des développements en série entière des fonctions elliptiques de Jacobi, J. Combin. Theory Ser. A, 29, 121, 10.1016/0097-3165(80)90001-1