EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 22 / No 3 (1988) RAIRO-Theor. Inf. Appl., 22 3 (1988) 361-388 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 22, Number 3, 1988
Page(s) 361 - 388
DOI https://doi.org/10.1051/ita/1988220303611
Published online 01 February 2017
  1. 1. R. ALTER, Some Remarks and Results on Catalan Numbers, in Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, 1971, p. 109-132. [MR: 329910] [Zbl: 0299.05002] [Google Scholar]
  2. 2. W. G. BROWN, Historical Note on a Recurrent Combinatorial Problem, Amer. Math. Monthly, vol.72, 1965, p. 973-977. [MR: 1533479] [Zbl: 0136.21204] [Google Scholar]
  3. 3. L. COMTET, Advanced Combinatorics, D. Reidel publ. comp., Boston, 1974, p. 56. [MR: 460128] [Zbl: 0283.05001] [Google Scholar]
  4. 4. R. DONAGHEY, Restricted Plane Tree Representations of Four Motzkin-Catalan Equations, J.C.T., Ser. B, 22, 1977, p. 114-121. [MR: 432532] [Zbl: 0352.05028] [Google Scholar]
  5. 5. R. DONAGHEY, Automorphisms on Catalan Trees and Bracketings, J.C.T., Ser. B, 29, 1980, p. 75-90. [MR: 584162] [Zbl: 0463.05038] [Google Scholar]
  6. 6. R. DONAGHEY et L. W. SHAPIRO, Motzkin Numbers, J.C.T., Ser. A, 23, 1977, p. 291-301. [MR: 505544] [Zbl: 0417.05007] [Google Scholar]
  7. 7. W. J. R. EPLETT, A Note About the Catalan Triangle, Discrete Math., vol. 25, 1979, p. 289-291. [MR: 534947] [Zbl: 0393.05014] [Google Scholar]
  8. 8. P. FLAJOLET, Combinatorial Aspects of Continued Fractions, Discrete Math., vol. 32, 1980, p. 125-161. [MR: 592851] [Zbl: 0445.05014] [Google Scholar]
  9. 9. I. GESSEL, A. Non Commutative Generalization of q-Analog of the Lagrange Inversion Formula, Trans. Amer. Math. Soc., vol. 257, 1980, p. 455-481. [MR: 552269] [Zbl: 0459.05014] [Google Scholar]
  10. 10. I. M. GESSEL et G. VIENNOT, Binomials Determinants, Paths and Hook Length Formulae, Advance in Maths., vol. 58, 1985, p. 300-321. [MR: 815360] [Zbl: 0579.05004] [Google Scholar]
  11. 11. H. W. GOULD, Research Bibliography of Two Special Number Sequences, rev. ed., Combinatorial Research Institute, Morgantown, W. Va., 1977. [MR: 401633] [Zbl: 0327.10001] [Google Scholar]
  12. 12. D. GOUYOU-BEAUCHAMPS, Deux propriétés combinatoires du langage de Lukasiewicz, R.A.I.R.O, vol. 3, 1975, p. 13-24. [EuDML: 92022] [MR: 395351] [Zbl: 0337.05010] [Google Scholar]
  13. 13. D. GOUYOU-BEAUCHAMPS, Chemins sous-diagonaux et tableaux de Young, in Combinatoire énumérative, p. 112-125, Lecture Notes in Math., n° 1234, G. LABELLE et P. LEROUX éd., Springer-Verlag, Berlin, 1986. [MR: 927762] [Zbl: 0611.05003] [Google Scholar]
  14. 14. D. GOUYOU-BEAUCHAMPS et G. VIENNOT, Equivalence of the Two-Dimensional Directed Animal Problem to a One-Dimensional Path Problem, in Adv. in Appl. Math. (à paraître). [MR: 956559] [Zbl: 0727.05036] [Google Scholar]
  15. 15. W. B. JONES et W. J. THRON, Continued Fractions, Analytic Theory and Applications, Encyclopedia of Math. and its Appl., vol. 11, G. C. ROTA éd., Addison-Wesley, Reading, 1980. [MR: 595864] [Zbl: 0603.30009] [Google Scholar]
  16. 16. C. JORDAN, Calculus of Finites Differences, Chelsea Publishing Company, New York, 1950, p. 449. [MR: 183987] [Zbl: 0154.33901] [Google Scholar]
  17. 17. D. A. KLARNER, Correspondance Between Plane Trees and Binary Sequences, J.C.T., vol. 9, 1970, p. 401-411. [MR: 292690] [Zbl: 0205.54702] [Google Scholar]
  18. 18. D. E. KNUTH, The art of Computer Programming, vol. 1, Fundamental Algorithms, 2nd ed., Addison Wesley, Reading, Ma., 1973, p. 235-239 et 533-534. [MR: 378456] [Google Scholar]
  19. 19. G. KREWERAS, Sur les éventails de segments, Cahiers du B.U.R.O., vol. 15, 1970, p. 3-41. [EuDML: 272576] [Google Scholar]
  20. 20. G. KREWERAS, Sur les partitions non croisées d'un cycle, Discrete Mathematics, vol. 1, n° 4, 1972, p. 333-350. [MR: 309747] [Zbl: 0231.05014] [Google Scholar]
  21. 21. G. KREWERAS, Sur les hiérarchies de segments, Cahiers du B.U.R.O., vol. 20, 1973, p. 3-61. [EuDML: 272619] [Google Scholar]
  22. 22. G. KREWERAS, Aires des chemins surdiagonaux à étapes obliques permises, Cahiers du B.U.R.O., vol. 24, 1976, p. 9-18. [EuDML: 272688] [Google Scholar]
  23. 23. L. MOSER et W. ZAYACHKOWSKI, Lattice Paths with Diagonal Steps, Scripta math., vol. 26, 1963, p. 223-229. [MR: 150064] [Zbl: 0111.24105] [Google Scholar]
  24. 24. T. MOTZKIN, Relation Between Hypersurface Cross Ratio and a Combinatorial Formula for Partitions of a Polygon, for Permanent Preponderance and for Non-Associative Products, Bul. Amer. Math. Soc., vol. 54, 1948, p. 352-360. [MR: 24411] [Zbl: 0032.24607] [Google Scholar]
  25. 25. G. POLYA, On the Number of Certain Lattice Polygons, J. Comb. Theory, vol. 6, 1969, p. 102-105. [MR: 236031] [Zbl: 0327.05010] [Google Scholar]
  26. 26. J. RIORDAN, Combinatorial Identities, Wiley, New York, 1968, p. 148 [MR: 231725] [Zbl: 0194.00502] [Google Scholar]
  27. 27. J. RIORDAN, Enumeration of Plane Trees by Branchs and Endpoints, J.C.T., Ser. A, 19, 1975, p. 214-222. [MR: 409241] [Zbl: 0308.05115] [Google Scholar]
  28. 28. J. RIORDAN, The Distribution of Crossing of Chords Joining Pairs of 2n Points on a Circle, Math. Comput., vol. 29, 1975, p. 215-222. [MR: 366686] [Zbl: 0319.05004] [Google Scholar]
  29. 29. D. G. ROGERS, A Schröder Triangle: Three Combinatorial Problems, Comb. Math. V: Proc. Fifth Aust. Conf., Lecture Notes in Math., 622, Springer-Verlag, Berlin, 1977. [MR: 462964] [Zbl: 0368.05004] [Google Scholar]
  30. 30. D. G. ROGERS, The Enumeration of a Family of Ladder Graphs Part I: Connective Relations, Quart. J. Math. Oxford, (2), 28, 1977, p. 421-431. [MR: 491365] [Zbl: 0373.05045] [Google Scholar]
  31. 30. D. G. ROGERS, The Enumeration of a Family of Ladder Graphs Part II: Schröder and Superconnective Relations, Quart. J. Math. Oxford, (2),31, 1980, p. 491-506. [MR: 596981] [Zbl: 0451.05034] [Google Scholar]
  32. 32. D. G. ROGERS, Pascal Triangles, Catalan Numbers and Renewal Arrays, Discrete Math., vol. 22, 1978, p. 301-310. [MR: 522725] [Zbl: 0398.05007] [Google Scholar]
  33. 33. D. G. ROGERS et L. W. SHAPIRO, Some Correspondance Involving the Schröder Numbers and Relations, in Comb. Math., Proc. of the Intern. Conf., Camberra, 1977, Lecture Notes in Math., vol. 686, Springer-Verlag, Berlin, 1978, p. 267-276. [MR: 526754] [Google Scholar]
  34. 34. D. G. ROGERS et L. W. SHAPIRO, Deques, Trees and Lattice Paths, in Comb. Math. VIII Proc., Geelong, Australia, 1980, Lecture Notes in Math., vol. 884, Springer-Verlag, Berlin, 1981, p. 293-303. [MR: 641254] [Zbl: 0469.05005] [Google Scholar]
  35. 35. L. W. SHAPIRO, A Short Proof of an Identity of Touchard's Concerning Catalan Numbers, J.C.T., Ser. A, 20, 1976, p. 375-376. [MR: 406819] [Zbl: 0337.05012] [Google Scholar]
  36. 36. L. W. SHAPIRO, A Catalan Triangle, Discrete Math., vol. 14, 1976, p. 83-90. [MR: 387069] [Zbl: 0323.05004] [Google Scholar]
  37. 37. SCHRÖDER, Vier Kombinatorische Probleme, Z. fur M. Phys., 15, 1870, p. 361-376. [Google Scholar]
  38. 38. N. J. A. SLOANE, A Handbook of Integer Sequences, Academic Press, New York, 1973. [MR: 357292] [Zbl: 0286.10001] [Google Scholar]
  39. 39. R. G. STANTON et D. D. COWAN, Note on a "Square" Functional Equation, S.I.A.M. Review, vol. 12, n° 2, 1970, p. 277-279. [MR: 260602] [Zbl: 0206.29301] [Google Scholar]
  40. 40. J. TOUCHARD, Sur certaines équations fonctionnelles, in Proc. Inter. Congr. Mat., p. 465-472, Univ. of Toronto Press, Toronto, 1928. [Zbl: 54.0440.03] [JFM: 54.0440.03] [Google Scholar]
  41. 41. M. VAUCHAUSSADE DE CHAUMONT et G. VIENNOT, Polynômes orthogonaux et problèmes d'énumération en biologie moléculaire, Proc. Séminaire Lotharingien, Sainte-Croix-aux-Mines, mai 1983. [Zbl: 0977.33500] [Google Scholar]
  42. 42. M. VAUCHAUSSADE DE CHAUMONT et G. VIENNOT, Enumeration of RNAs secondary structure by complexity, in Mathematics in Medecine and Biology, V. CAPASSO, E. GROSSO and S. L. PAVEN-FONTANA éd., Lecture Notes in Biomath., n° 57, Springer-Verlag, Berlin, 1985, p. 360-365. [Zbl: 0579.92012] [Google Scholar]
  43. 43. G. VIENNOT, Une théorie combinatoire des polynômes orthogonaux généraux, 217 p., Astérisque, Soc. Math. France (à paraître). [Google Scholar]
  44. 44. G. VIENNOT, Une théorie combinatoire des approximants de Padé, Réunion d'été de la Soc. Math, du Can., Québec, juin 1985, rapport Bordeaux, n° 8611. [Google Scholar]
  45. 45. G. VIENNOT, Problèmes combinatoires posés par la physique statistique, Séminaire Bourbaki, 36e année, 1983/1984. exposé n° 626, in Astérisque, Soc. Math. France, n° 121-122, 1985, p. 225-246. [EuDML: 110026] [MR: 768962] [Zbl: 0563.60095] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.