A survey of the Fine numbers

Discrete Mathematics

Volumn 241, Issue 1-3, 2001, Pages 241-265

  Deutsch, Emeric ^a   Shapiro, Louis ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b HOWARD UNIVERSITY   (United States)

Author keywords

Catalan numbers; Fine numbers; Noncrossing partitions; Path pairs; Paths; Plane (ordered) trees

Indexed keywords

EID: 0035965434     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00121-2     Document Type: Article

References (50)

1. M. Aigner, Catalan-like numbers and determinants, J. Combin. Theory Ser. A 87 (1999) 33-51.
2. E.A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (4) (1974) 485-515.
3. F. Bernhart, Catalan, Motzkin, and Riordan numbers, Discrete Math. 204 (1999) 73-112.
4. M. Bousquet-Mélou, q-énumération de polyominos convexes, J. Combin. Theory Ser. A 64 (2) (1993) 265-288.
5. M. Bousquet-Mélou, X.G. Viennot, Empilements de segments et q-énumération de polyominos convexes dirigés, J. Combin. Theory Ser. A 60 (2) (1992) 196-224.
6. T.J.I'a. Bromwich, An Introduction to the Theory of Infinite Series, Macmillan, London, 1959.
7. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, Boston, 1974.
8. J.H. Conway, R.K. Guy, The Book of Numbers, Copernicus (an imprint of Springer), New York, 1996.
9. B. Dasarathy, C. Yang, A transformation on ordered trees, Comput. J. 23 (2) (1980) 161-164.
10. M.P. Delest, G. Viennot, Algebraic languages and polyominoes enumeration, Theoret. Comput. Sci. 34 (1984) 169-206.
11. N. Dershowitz, S. Zaks, Enumerations of ordered trees, Discrete Math. 31 (1980) 9-28.
12. N. Dershowitz, S. Zaks, Ordered trees and non-crossing partitions, Discrete Math. 62 (1986) 215-218.
13. E. Deutsch, A bijection on Dyck paths and its consequences, Discrete Math. 179 (1998) 253-256, (see also Corrigendum 187 (1998) 297, for the missing Fig. 1).
14. E. Deutsch, A bijection on Dyck paths and its consequences, Discrete Math. 179 (1998) 253-256, (see also Corrigendum 187 (1998) 297, for the missing Fig. 1).
15. E. Deutsch, Dyck path enumeration, Discrete Math. 204 (1999) 167-202.
16. E. Deutsch, An involution on Dyck paths and its consequences, Discrete Math. 204 (1999) 163-166.
17. R.P. Dobrow, J.A. Fill, On the Markov chain for the move-to-root rule for binary search trees, Ann. Appl. Probab. 5 (1) (1995) 1-19.
18. R. Donaghey, L.W. Shapiro, Motzkin numbers, J. Combin. Theory Ser. A 23 (1977) 291-301.
19. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, Wiley, New York, 1968.
20. T. Fine, Extrapolation when very little is known about the source, Inform. and Control 16 (1970) 331-359.
21. P. Flajolet, R. Sedgewick, Analytic Combinatorics, Book in preparation, 1998. (Individual chapters are available as INRIA Research Reports 1888, 2026, 2376, 2956, 3162.)
22. M. Gardner, Time Travel and Other Mathematical Bewilderments, Freeman, New York, 1988.
23. H.W. Gould, Research bibliography of two special sequences, rev. edition, Combinatorial Research Institute, Morgantown, West Virginia, 1977.
24. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, 2nd Edition, Addison-Wesley, Reading, MA, 1994.
25. F. Harary, R.C. Read, The enumeration of tree-like polyhexes, Proc. Edinburgh Math. Soc. 17 (1970) 1-13.
26. P. Hilton, J. Pedersen, The ballot problem and Catalan numbers, Nieuw Arch. Wisk. (4) 8 (2) (1990) 209-216.
27. E. Jabotinsky, Representation of functions by matrices. Application to Faber polynomials, Proc. Amer. Math. Soc. 4 (1953) 546-553.
28. E. Jabotinsky, Analytic iteration, Trans. Amer. Math. Soc. 108 (1963) 457-477.
29. K.H. Kim, D.G. Rogers, F.W. Roush, Similarity relations and semiorders, Proceedings of 10th Southeastern Conference, Boca Raton, 1979, Congressus Numerantium, XXIII-XXIV, Utilitas Mathematica, Winnipeg, Man., 1979, pp. 577-594.
30. J.L. Lavoie, R. Tremblay, The Jabotinsky matrix of a power series, SIAM J. Math. Anal. 12 (6) (1981) 819-825.
31. A. Meir, J.W. Moon, Path edge-covering constants for certain families of trees, Utilitas Math. 14 (1978) 313-333.
32. D. Merlini, D.G. Rogers, R. Sprugnoli, M.C. Verri, On some alternative characterizations of Riordan arrays, Canad. J. Math. 49 (2) (1997) 301-320.
33. J.W. Moon, Some enumeration problems for similarity relations, Discrete Math. 26 (1979) 251-260.
34. J. Riordan, Combinatorial Identities, Wiley, New York, 1968.
35. J. Riordan, Enumeration of plane trees by branches and endpoints, J. Combin. Theory Ser. A 19 (1975) 214-222.
36. D.G. Rogers, Similarity relations on finite ordered sets, J. Combin. Theory Ser. A 23 (1977) 88-98 Erratum: 25 (1978) 95-96.
37. D.G. Rogers, Pascal triangles, Catalan numbers and renewal arrays, Discrete Math. 22 (1978) 301-310.
38. S. Roman, The Umbral Calculus, Academic Press, New York, 1984.
39. G.-C. Rota, Finite Operator Calculus, Academic Press, New York, 1975.
40. R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
41. L.W. Shapiro, A Catalan triangle, Discrete Math. 14 (1976) 83-90.
42. L.W. Shapiro, S. Getu, W.-J. Woan, L.C. Woodson, The Riordan group, Discrete Appl. Math. 34 (1991) 229-239.
43. N.J.A. Sloane, A Handbook of Integer Sequences, Academic Press, San Diego, 1973.
44. N.J.A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, San Diego, 1995.
45. R. Sprugnoli, Riordan arrays and combinatorial sums, Discrete Math. 132 (1994) 267-290.
46. R.P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge, 1999.
47. D. Stanton, D. White, Constructive Combinatorics, Springer, New York, 1986.
48. V. Strehl, A note on similarity relations, Discrete Math. 19 (1977) 99-101.
49. X.G. Viennot, Heaps of pieces I: basic definitions and combinatorial lemmas, in: G. Labelle, P. Leroux (Eds.), Combinatoire Enumerative, Lecture Notes in Mathematics, Vol. 1234, Springer, Berlin, 1986, pp. 321-350.
50. H.S. Wilf, generatingfunctionology, 2nd Edition, Academic Press, New York, 1994.