Combinatorics of compositions and words

Combinatorics of Compositions and Words

Volumn , Issue , 2009, Pages 1-480

  Heubach, Silvia ^a   Mansour, Toufik ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (194)

1. M. Abramson. Enumeration of sequences by levels and rises. Discrete Math., 12:101–112, 1975.
2. M. Abramson. Restricted combinations and compositions. Fibonacci Quart., 14(5):439–452, 1976.
3. A.K. Agarwal. n-colour compositions. Indian J. Pure Appl. Math., 31(11):1421–1427, 2000.
4. A.K. Agarwal. An analogue of Euler’s identity and new combinatorial properties of n-colour compositions. J. Comput. Appl. Math., 160:9–15, 2003.
5. L.V. Ahlfors. Complex Analysis. McGraw-Hill Book Co., New York, third edition, 1978.
6. M.H. Albert, R.E.L. Aldred, M.D. Atkinson, C. Handley, and D. Holton. Permutations of a multiset avoiding permutations of length 3. European J. Combin., 22(8):1021–1031, 2001.
7. K. Alladi and V.E. Hoggatt, Jr. Compositions with ones and twos. Fibonacci Quart., 13(3):233–239, 1975.
8. N. Alon and J.H. Spencer. The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2000.
9. G.E. Andrews. Ramanujan’s “lost” notebook. IV. Stacks and alternating parity in partitions. Adv. in Math., 53(1):55–74, 1984.
10. G.E. Andrews. The Theory of Partitions. Cambridge Mathematical Library. Cambridge University Press, Cambridge, 1998.
11. E. Babson and E. Steingrímsson. Generalized permutation patterns and a classification of the Mahonian statistics. Sém. Lothar. Combin., 44:Art. B44b, 2000.
12. 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(4):1119–1178, 1999.
13. C. Banderier, M. Bousquet-Mélou, A. Denise, P. Flajolet, D. Gardy, and D. Gouyou-Beauchamps. Generating functions for generating trees. Discrete Math., 246(1-3):29–55, 2002.
14. E. Barcucci, A. Del Lungo, E. Pergola, and R. Pinzani. A construction for enumerating k-coloured Motzkin paths. In Computing and combinatorics (Xi’an, 1995), volume 959 of Lecture Notes in Comput. Sci., pages 254–263. Springer, Berlin, 1995.
15. E. Barcucci, A. Del Lungo, E. Pergola, and R. Pinzani. A methodology for plane tree enumeration. Discrete Math., 180:45–64, 1998.
16. E. Barcucci, A. Del Lungo, E. Pergola, and R. Pinzani. ECO: a methodology for the enumeration of combinatorial objects. J. Differ. Equations Appl., 5(4-5):435–490, 1999.
17. J.-L. Baril and P.-T. Do. ECO-generation for compositions and their restrictions. Proceedings of PP’08, 2008.
18. E.A. Bender. Central and local limit theorems applied to asymptotic enumeration. J. Combin. Theory Ser. A, 15:91–111, 1973.
19. E.A. Bender and E.R. Canfield. Locally restricted compositions. I. Restricted adjacent differences. Electron.J.Combin., 12:#R57, 2005.
20. E.A. Bender, G.F. Lawler, R. Pemantle, and H.S. Wilf. Irreducible compositions and the first return to the origin of a random walk. Sém. Lothar. Combin., 50:Art. B50h, 2003/04.
21. E.A. Bender and L.B. Richmond. Central and local limit theorems applied to asymptotic enumeration. II. multivariate generating functions. J. Combin. Theory Ser. A, 34(3):255–265, 1983.
22. A.T. Benjamin and J.J. Quinn. Proofs that really count, volume27of The Dolciani Mathematical Expositions. Mathematical Association of America, Washington, DC, 2003.
23. A. Bernini, L. Ferrari, and R. Pinzani. Enumeration of some classes of words avoiding two, generalized patterns of length three. arXiv:0711.3387v1, 2007.
24. P. Billingsley. Probability and Measure. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons Inc., New York, third edition, 1995. A Wiley-Interscience Publication.
25. M. Bóna. Combinatorics of Permutations. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL, 2004.
26. M. Bousquet-Mélou and A. Rechnitzer. The site-perimeter of bargraphs. Adv. in Appl. Math., 31:86–112, 2003.
27. P. Brändén and T. Mansour. Finite automata and pattern avoidance in words. J. Combin. Theory Ser. A, 110(1):127–145, 2005.
28. C. Brennan and A. Knopfmacher. The distribution of ascents of size d or more in compositions. Discrete Math. Theor. Comput. Sci., 11(1):1–10, 2009.
29. R. Brigham, R. Caron, P. Chinn, and R.P. Grimaldi. A tiling scheme for the Fibonacci numbers. J. Recreational Mathematics, 28(1):10–17, 1996.
30. R.C. Brigham, P.Z. Chinn, L.M. Holt, and R.S. Wilson. Finding the recurrence relation for tiling 2 × n rectangles. Congr. Numer., 105:134– 138, 1994.
31. A. Burstein. Enumeration of words with forbidden patterns. Ph.D. thesis, University of Pennsylvania, 1998.
32. A. Burstein, P. Hästö, and T. Mansour. Packing patterns into words. Electron.J.Combin., 9(2):#R20, 2002/03.
33. A. Burstein and T. Mansour. Words restricted by patterns with at most 2 distinct letters. Electron.J.Combin., 9(2):#R3, 2002/03.
34. A. Burstein and T. Mansour. Counting occurrences of some subword patterns. Discrete Math. Theor. Comput. Sci., 6(1):1–11, 2003.
35. A. Burstein and T. Mansour. Words restricted by 3-letter generalized multipermutation patterns. Ann. Comb., 7(1):1–14, 2003.
36. L. Carlitz. Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem. Duke Math. J., 39:267–280, 1972.
37. L. Carlitz. Enumeration of up-down sequences. Discrete Math., 4:273– 286, 1973.
38. L. Carlitz. Restricted compositions. Fibonacci Quart., 14(3):254–264, 1976.
39. L. Carlitz. Enumeration of compositions by rises, falls and levels. Math. Nachr., 77:361–371, 1977.
40. L. Carlitz. Up-down and down-up partitions. In Studies in foundations and combinatorics, volume 1 of Adv. in Math. Suppl. Stud., pages 101– 129. Academic Press, New York, 1978.
41. L. Carlitz and R. Scoville. Up-down sequences. Duke Math. J., 39:583– 598, 1972.
42. L. Carlitz, R. Scoville, and T. Vaughan. Enumeration of pairs of sequences by rises, falls and levels. Manuscripta Math., 19(3):211–243, 1976.
43. L. Carlitz and T. Vaughan. Enumeration of sequences of given specification according to rises, falls and maxima. Discrete Math., 8:147–167, 1974.
44. F. Cazals. Monomer-dimer tilings. On INRIA web page, 1997.
45. M. Cerasoli. Enumeration of compositions with prescribed parts. J. Math. Anal. Appl., 89(2):351–358, 1982.
46. Ch.A. Charalambides. On the enumeration of certain compositions and related sequences of numbers. Fibonacci Quart., 20(2):132–146, 1982.
47. W.Y.C. Chen, E.Y.P. Deng, R.R.X. Du, R.P. Stanley, and C.H. Yan. Crossings and nestings of matchings and partitions. Trans. Amer. Math. Soc., 359(4):1555–1575 (electronic), 2007.
48. P. Chinn, R.P. Grimaldi, and S. Heubach. The frequency of summands of a particular size in palindromic compositions. Ars Combin., 69:65–78, 2003.
49. P. Chinn, R.P. Grimaldi, and S. Heubach. Tilings with ls and squares. J. Integer Seq., 10(2):Art. 07.2.8, 2007.
50. P. Chinn and S. Heubach. (1, k)-compositions. Congr. Numer., 164:183– 194, 2003.
51. P. Chinn and S. Heubach. Compositions of n with no occurrence of k. Congr. Numer., 164:33–51, 2003.
52. P. Chinn and S. Heubach. Integer sequences related to compositions without 2’s. J. Integer Seq., 6(2):Art. 03.2.3, 2003.
53. T. Chow and J. West. Forbidden subsequences and Chebyshev polynomials. Discrete Math., 204(1-3):119–128, 1999.
54. F.R.K. Chung, R.L. Graham, V.E. Hoggatt, Jr., and M. Kleiman. The number of Baxter permutations. J. Combin. Theory Ser. A, 24(3):382– 394, 1978.
55. A. Claesson. Generalized pattern avoidance. European J. Combin., 22(7):961–971, 2001.
56. S. Corteel and C.D. Savage. Partitions and compositions defined by inequalities. Ramanujan J., 8(3):357–381, 2004.
57. S. Corteel, C.D. Savage, and H.S. Wilf. A note on partitions and compositions defined by inequalities. Integers, 5(1):A24, 2005.
58. A. de Mier. k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams. Electron. Notes Discrete Math., 28:3–10, 2007.
59. R. Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, third edition, 2005.
60. J.F. Dillon and D.P. Roselle. Simon Newcomb’s problem. SIAM J. Appl. Math., 17:1086–1093, 1969.
61. J. Dollhopf, I. Goulden, and C. Greene. Words avoiding a reflexive acyclic relation. Electron. J. Combin., 11(2):#R28, 2004/06.
62. A.A. Evdokimov and V. Nyu. The length of a supersequence for a set of binary words with a given number of units. Metody Diskret. Anal., 52:49–58, 1992.
63. L. Ferrari, E. Pergola, R. Pinzani, and S. Rinaldi. An algebraic characterization of the set of succession rules. Theoret. Comput. Sci., 281(1-2):351–367, 2002.
64. G. Firro and T. Mansour. Three-letter-pattern-avoiding permutations and functional equations. Electron.J.Combin., 13(1):#R51, 2006.
65. G. Firro and T. Mansour. Restricted k-ary words and functional equations. Discrete Appl. Math., 157(4):602–616, 2009.
66. M.E. Fisher. Statistical mechanics of dimers on a plane lattice. Phys. Rev. (2), 124:1664–1672, 1961.
67. P. Flajolet, X. Gourdon, and P. Dumas. Mellin transforms and asymptotics: harmonic sums. Theoret. Comput. Sci., 144(1-2):3–58, 1995.
68. P. Flajolet and R. Sedwick. Analytic Combinatorics. Cambridge University Press, 2009.
69. I. Flores. Direct calculation of k-generalized Fibonacci numbers. Fibonacci Quart., 5:259–266, 1967.
70. D. Foata and G.-N. Han. Inverses of words. Sém. Lothar. Combin., 39:Art. B39d, 1997.
71. D. Foata and G.-N. Han. Transformations on words. J. Algorithms, 28(1):172–191, 1998.
72. T. Fort. Finite Differences and Difference Equations in the Real Domain. Oxford, at the Clarendon Press, 1948.
73. W.M.Y. Goh and P. Hitczenko. Average number of distinct part sizes in a random Carlitz composition. European J. Combin., 23(6):647–657, 2002.
74. H.W. Gould. Binomial coefficients, the bracket function, and compositions with relatively prime summands. Fibonacci Quart., 2:241–260, 1964.
75. I.P. Goulden and D.M. Jackson. Combinatorial enumeration. Dover Publications Inc., Mineola, NY, 2004.
76. R.P. Grimaldi. Compositions with odd summands. Congr. Numer., 142:113–127, 2000.
77. R.P. Grimaldi. Compositions without the summand 1. Congr. Numer., 152:33–43, 2001.
78. R.P. Grimaldi. Discrete and Combinatorial Mathematics: An Applied Introduction. Addison Wesley, 2003.
79. R.P. Grimaldi. Compositions and the alternate Fibonacci numbers. Congr. Numer., 186:81–96, 2007.
80. G.R. Grimmett and D.R. Stirzaker. Probability and random processes. Oxford University Press, New York, third edition, 2001.
81. E.O. Hare and P. Chinn. Tiling with Cuisenaire rods. In Applications of Fibonacci numbers, Vol. 6 (Pullman, WA, 1994), pages 165–171. Kluwer Acad. Publ., Dordrecht, 1996.
82. H.A. Helfgott and I.M. Gessel. Enumeration of tilings of diamonds and hexagons with defects. Electron.J.Combin., 6:#R16, 1999.
83. P. Henrici. Applied and Computational Complex Analysis. John Wiley & Sons Inc., New York, 1974-1977.
84. S. Heubach. Tiling an m-by-n area with squares of size up to k-by-k (m ≤ 5). Congr. Numer., 140:43–64, 1999.
85. S. Heubach and P. Chinn. Patterns arising from tiling rectangles with 1-by-1 and 2-by-2 squares. Congr. Numer., 150:173–192, 2001.
86. S. Heubach, P. Chinn, and P. Callahan. Tiling with trominoes. Congr. Numer., 177:33–44, 2005.
87. S. Heubach, P. Chinn, and R.P. Grimaldi. Rises, levels, drops and “+” signs in compositions: extensions of a paper by Alladi and Hoggatt. Fibonacci Quart., 41(3):229–239, 2003.
88. S. Heubach, S. Kitaev, and T. Mansour. Partially ordered patterns in compositions. Pure Math. Appl., 17(1-2):123–134, 2006.
89. S. Heubach and T. Mansour. Compositions of n with parts in a set. Congr. Numer., 168:127–143, 2004.
90. S. Heubach and T. Mansour. Counting rises, levels, and drops in compositions. Integers, 5(1):A11, 2005.
91. S. Heubach and T. Mansour. Avoiding patterns of length three in compositions and multiset permutations. Adv. in Appl. Math., 36(2):156– 174, 2006.
92. S. Heubach and T. Mansour. Enumeration of 3-letter patterns in compositions. In Combinatorial Number Theory, pages 243–264. deGruyter, 2007.
93. P. Hitczenko and G. Louchard. Distinctness of compositions of an integer: a probabilistic analysis. Random Structures Algorithms, 19(3-4):407–437, 2001.
94. P. Hitczenko, C. Rousseau, and C.D. Savage. A generatingfunctionology approach to a problem of Wilf. J. Comput. Appl. Math., 142:107–114, 2002.
95. P. Hitczenko and C.D. Savage. On the probability that a randomly chosen part size in a random composition is unrepeated. In Paul Erdős and his mathematics (Budapest, 1999), pages 108–111. János Bolyai Math. Soc., Budapest, 1999.
96. P. Hitczenko and C.D. Savage. On the multiplicity of parts in a random composition of a large integer. SIAM J. Discrete Math., 18(2):418–435 (electronic), 2004.
97. P. Hitczenko and G. Stengle. Expected number of distinct part sizes in a random integer composition. Combin. Probab. Comput., 9(6):519–527, 2000.
98. V.E. Hoggatt, Jr. and M. Bicknell. Palindromic compositions. Fibonacci Quart., 13(4):350–356, 1975.
99. V.E. Hoggatt, Jr. and D.A. Lind. Fibonacci and binomial properties of weighted compositions. J. Combin. Theory Ser. A, 4:121–124, 1968.
100. V.E. Hoggatt, Jr. and D.A. Lind. Compositions and Fibonacci numbers. Fibonacci Quart., 7(3):253–266, 1969.
101. J.E. Hopcroft, R. Motwani, and J.D. Ullman. Introduction to automata theory, languages and computation. Addison Wesley, 2001.
102. H.-K. Hwang and Y.-N. Yeh. Measures of distinctness for random partitions and compositions of an integer. Adv. in Appl. Math., 19(3):378– 414, 1997.
103. B. Jackson and F. Ruskey. Meta-Fibonacci sequences, binary trees and extremal compact codes. Electron.J.Combin., 13(1):#R26, 2006.
104. V. Jelínek and T. Mansour. On pattern-avoiding partitions. Electron. J. Combin., 15(1):#R39, 2008.
105. V. Jelínek and T. Mansour. Wilf-equivalence on k-ary words, compositions, and parking functions. Electron.J.Combin., 16(1):#R58, 2009.
106. C. Kenyon, D. Randall, and A. Sinclair. Approximating the number of monomer-dimer coverings of a lattice. J. Statist. Phys., 83(3-4):637–659, 1996.
107. R. Kenyon. Local statistics of lattice dimers. Ann. Inst. H. Poincaré Probab. Statist., 33(5):591–618, 1997.
108. S. Kitaev. Partially ordered generalized patterns. Discrete Math., 298(1-3):212–229, 2005.
109. S. Kitaev and T. Mansour. Partially ordered generalized patterns and k-ary words. Ann. Comb., 7(2):191–200, 2003.
110. S. Kitaev, T. Mansour, and J.B. Remmel. Counting descents, rises, and levels, with prescribed first element, in words. Discrete Math. Theor. Comput. Sci., 10(3):1–22, 2008.
111. S. Kitaev, T.B. McAllister, and T.K. Petersen. Enumerating segmented patterns in compositions and encoding by restricted permutations. Integers, 6:A34, 2006.
112. M. Klazar. On abab-free and abba-free set partitions. European J. Combin., 17(1):53–68, 1996.
113. M. Klazar. On trees and noncrossing partitions. Discrete Appl. Math., 82(1-3):263–269, 1998.
114. M. Kline. Mathematical Thought from Ancient to Modern Times. Oxford University Press, 1972.
115. A. Knopfmacher and T. Mansour. Record statistics in a random composition. Preprint, 2009.
116. A. Knopfmacher, T. Mansour, A. Munagi, and H. Prodinger. Smooth words and Chebyshev polynomials. Preprint, 2008.
117. A. Knopfmacher and M.E. Mays. Compositions with m distinct parts. Ars Combin., 53:111–128, 1999.
118. A. Knopfmacher and M.E. Mays. The sum of distinct parts in compositions and partitions. Bull.Inst.Combin.Appl., 25:66–78, 1999.
119. A. Knopfmacher and H. Prodinger. On Carlitz compositions. European J. Combin., 19(5):579–589, 1998.
120. A. Knopfmacher and N. Robbins. On binary and Fibonacci compositions. Ann. Univ. Sci. Budapest. Sect. Comput., 22:193–206, 2003.
121. A. Knopfmacher and N. Robbins. Compositions with parts constrained by the leading summand. Ars Combin., 76:287–295, 2005.
122. D.E. Knuth. The art of computer programming. Volume 3. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1973.
123. D.E. Knuth. The art of computer programming. Volume 1. Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, second edition, 1975.
124. D.E. Knuth. The average time for carry propagation. Nederl. Akad. Wetensch. Indag. Math., 40(2):238–242, 1978.
125. T. Koshy. Fibonacci and Lucas numbers with applications. Pure and Applied Mathematics (New York). Wiley-Interscience, New York, 2001.
126. C. Krattenthaler. Permutations with restricted patterns and Dyck paths. Adv. in Appl. Math., 27(2-3):510–530, 2001.
127. C. Krattenthaler. Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes. Adv. in Appl. Math., 37(3):404–431, 2006.
128. V. Lakshmibai and B. Sandhya. Criterion for smoothness of Schubert varieties in Sl(n)/B. Proc. Indian Acad. Sci. Math. Sci., 100(1):45–52, 1990.
129. L. Lipshitz. D-finite power series. J. Algebra, 122(2):353–373, 1989.
130. M. Lothaire. Combinatorics on Words. Cambridge Mathematical Library. Cambridge University Press, Cambridge, 1997.
131. M. Lothaire. Algebraic combinatorics on words, volume90ofEncyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2002.
132. M. Lothaire. Applied combinatorics on words, volume 105 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2005.
133. G. Louchard. The number of distinct part sizes of some multiplicity in compositions of an integer: A probabilistic analysis. In Random Walks, volume AC of DMTCS Proceedings, pages 155–170. Discrete Mathematics and Theoretical Computer Science, 2003.
134. G. Louchard and H. Prodinger. Probabilistic analysis of Carlitz compositions. Discrete Math. Theor. Comput. Sci., 5(1):71–95, 2002.
135. I.D. MacDonald. Some group elements defined by commutators. Math. Sci., 4(2):129–131, 1979.
136. P.A. MacMahon. Memoir on the theory of the compositions of numbers. Phil. Trans. Royal Society London. A, 184:835–901, 1893.
137. P.A. MacMahon. The Indices of Permutations and the Derivation Therefrom of Functions of a Single Variable Associated with the Permutations of any Assemblage of Objects. Amer.J.Math., 35(3):281–322, 1913.
138. P.A. MacMahon. Combinatory analysis. Vol. I, II (bound in one volume). Dover Phoenix Editions. Dover Publications Inc., Mineola, NY, 2004. Reprint of An introduction to combinatory analysis (1920) and Combinatory analysis. Vol. I, II (1915, 1916).
139. T. Mansour. http://math.haifa.ac.il/toufik/automaton01.html. Automaton program, 2003.
140. T. Mansour. http://math.haifa.ac.il/toufik/table4auto.html. Table of values computed with automaton program, 2003.
141. T. Mansour. Restricted 132-avoiding k-ary words, Chebyshev polynomials, and continued fractions. Adv. in Appl. Math., 36(2):175–193, 2006.
142. T. Mansour. Longest alternating subsequences in pattern-restricted kary words. Online J. Analytic Combin., 3:#5, 2008.
143. T. Mansour. Longest alternating subsequences of k-ary words. Discrete Appl. Math., 156(1):119–124, 2008.
144. T. Mansour. Smooth partitions and Chebyshev polynomials. Preprint, 2008.
145. T. Mansour and B.O. Sirhan. Counting l-letter subwords in compositions. Discrete Math. Theor. Comput. Sci., 8(1):285–297, 2006.
146. k. Discrete Math. Theor. Comput. Sci., 4(1):67–75, 2000.
147. T. Mansour and A. Vainshtein. Restricted 132-avoiding permutations. Adv. in Appl. Math., 26(3):258–269, 2001.
148. T. Mansour and A. Vainshtein. Restricted permutations and Chebyshev polynomials. Sém. Lothar. Combin., 47:Art. B47c, 2001/02.
149. T. Mansour and A. Vainshtein. Counting occurrences of 132 in a permutation. Adv. in Appl. Math., 28(2):185–195, 2002.
150. J.E. Marsden and M.J. Hoffman. Basic complex analysis. W. H. Freeman and Company, New York, second edition, 1987.
151. R.B. McQuistan and S.J. Lichtman. Exact recursion relation for 2 x n arrays of dumbbells. J. Math. Phy., 11(10):3095–3099, 1970.
152. D. Merlini, R. Sprugnoli, and M.C. Verri. Strip tiling and regular grammars. Theoret. Comput. Sci., 242(1-2):109–124, 2000.
153. D. Merlini, R. Sprugnoli, and M.C. Verri. A strip-like tiling algorithm. Theoret. Comput. Sci., 282(2):337–352, 2002.
154. D. Merlini, F. Uncini, and M.C. Verri. A unified approach to the study of general and palindromic compositions. Integers, 4:A23, 2004.
155. S.G. Mohanty. Some properties of compositions and their application to the ballot problem. Canad. Math. Bull., 8:359–372, 1965.
156. S.G. Mohanty. Restricted compositions. Fibonacci Quart., 5:223–234, 1967.
157. A.N. Myers. Pattern avoidance in multiset permutations: bijective proof. Ann. Comb., 11(3-4):507–517, 2007.
158. A.N. Myers and H.S. Wilf. Left-to-right maxima in words and multiset permutations. Israel J. Math., 166:167–183, 2008.
159. G. Narang and A.K. Agarwal. n-colour self-inverse compositions. Proc. Indian Acad. Sci. Math. Sci., 116(3):257–266, 2006.
160. G. Narang and A.K. Agarwal. Lattice paths and n-colour compositions. Discrete Math., 308(9):1732–1740, 2008.
161. T.V. Narayana. Sur les treillis formés par les partitions d’un entier et leurs applications àlathéorie des probabilités. C. R. Acad. Sci. Paris, 240:1188–1189, 1955.
162. T.V. Narayana and G.E. Fulton. A note on the compositions of an integer. Canad. Math. Bull., 1:169–173, 1958.
163. J. Noonan and D. Zeilberger. The enumeration of permutations with a prescribed number of “forbidden” patterns. Adv. in Appl. Math., 17(4):381–407, 1996.
164. A.M. Odlyzko. Asymptotic enumeration methods. In Handbook of combinatorics, Vol. 1, 2, pages 1063–1229. Elsevier, Amsterdam, 1995.
165. H. Prodinger. Combinatorics of geometrically distributed random variables: left-to-right maxima. Discrete Math., 153:253–270, 1996.
166. H. Prodinger. Records in geometrically distributed words: sum of positions. Appl. Anal. Discrete Math., 2(2):234–240, 2008.
167. J. Propp. Enumeration of matchings: problems and progress. In L. J. Billera, A. Björner, C. Greene, R. E. Simion, and R. P. Stanley, editors, New perspectives in algebraic combinatorics, volume38ofMathematical Sciences Research Institute Publications, pages 255–291. Cambridge University Press, 1999.
168. D. Rawlings. Restricted words by adjacencies. Discrete Math., 220:183– 200, 2000.
169. A. Regev. Asymptotics of the number of k-words with an l-descent. Electron.J.Combin., 5:#R15, 1998.
170. M. Régnier and W. Szpankowski. On the approximate pattern occurrences in a text, in Compression and Complexity of Sequences 1997. IEEE Computer Society, pages 253–264, 1998.
171. B. Richmond and A. Knopfmacher. Compositions with distinct parts. Aequationes Math., 49:86–97, 1995.
172. A. Riese. qMultiSum—a package for proving q-hypergeometric multiple summation identities. J. Symbolic Comput., 35(3):349–376, 2003.
173. Th. Rivlin. Chebyshev polynomials. Pure and Applied Mathematics (New York). John Wiley & Sons Inc., New York, second edition, 1990.
174. A. Robertson, H.S. Wilf, and D. Zeilberger. Permutation patterns and continued fractions. Electron.J.Combin., 6:#R38, 1999.
175. B.E. Sagan. Proper partitions of a polygon and k-Catalan numbers. Ars Combin., 88:109–124, 2008.
176. C.D. Savage and H.S. Wilf. Pattern avoidance in compositions and multiset permutations. Adv. in Appl. Math., 36(2):194–201, 2006.
177. C. Schensted. Longest increasing and decreasing subsequences. Canad. J. Math., 13:179–191, 1961.
178. R. Servedio and Y.-N. Yeh. A bijective proof on circular compositions. Bull. Inst. Math. Acad. Sinica, 23(4):283–293, 1995.
179. R. Simion and F.W. Schmidt. Restricted permutations. European J. Combin., 6:383–406, 1985.
180. N.J.A. Sloane. The on-line encyclopedia of integer sequences. published electronically at http://www.research.att.com/∼njas/sequences/, 2009.
181. K. Srinivase Rao and A.K. Agarwal. On a generalized composition function. J. Indian Math. Soc. (N.S.), 67(1-4):99–106, 2000.
182. R.P. Stanley. Enumerative combinatorics. Vol. 1, volume49 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1997.
183. R.P. Stanley. Enumerative combinatorics. Vol. 2, volume62ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999.
184. Axel Thue. Über unendliche Zahlenreihen. In Trygve Nagell, Atle Selberg, Sigmund Selberg, and Knut Thalberg, editors, Selected Mathematical papers of Axel Thue, pages 139–158. Universitetsforlaget, 1977. Originally published in Kra. Vidensk. Selsl. Skrifter. I. Mat. Nat. Kl. 1906. No. 7. Kra. 1906.
185. Axel Thue. Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. In Trygve Nagell, Atle Selberg, Sigmund Selberg, and Knut Thalberg, editors, Selected Mathematical papers of Axel Thue, pages 413–478. Universitetsforlaget, 1977. Originally published in Kra. Vidensk. Selsl. Skrifter. I. Mat. Nat. Kl. 1912. No. 1. Kra. 1912.
186. Axel Thue. Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. In Trygve Nagell, Atle Selberg, Sigmund Selberg, and Knut Thalberg, editors, Selected Mathematical papers of Axel Thue, pages 493–524. Universitetsforlaget, 1977. Originally published in Kra. Vidensk. Selsl. Skrifter. I. Mat. Nat. Kl. 1914. No. 10. Kra. 1914.
187. C.A. Tracy and H. Widom. On the distributions of the lengths of the longest monotone subsequences in random words. Probab. Theory Related Fields, 119(3):350–380, 2001.
188. A.J. van Zanten. The ranking problem of a Gray code for compositions. Ars Combin., 41:257–268, 1995.
189. N.Y. Vilenkin. Combinatorics. Academic Press, New York-London, 1971.
190. M. Wachs and D. White. p, q-Stirling numbers and set partition statistics. J. Combin. Theory Ser. A, 56(1):27–46, 1991.
191. J. West. Permutations with forbidden subsequences and stack sortable permutations. Ph.D. thesis, M.I.T., 1990.
192. J. West. Generating trees and forbidden subsequences. In Proceedings of the 6th Conference on Formal Power Series and Algebraic Combinatorics (New Brunswick, NJ, 1994), volume 157, pages 363–374, 1996.
193. H.S. Wilf. Generatingfunctionology, 2nd Edition. Academic Press, Inc., San Diego, 1994.
194. J. Wimp and D. Zeilberger. Resurrecting the asymptotics of linear recurrences. J. Math. Anal. Appl., 111(1):162–176, 1985.