The number of coverings in four Catalan lattices

International Journal of Computer Mathematics

Volumn 61, Issue 1-2, 1996, Pages 19-28

  Germain, Christian ^a   Pallo, Jean ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Binary bracketings; Binary trees; Coverings; Lattices

Indexed keywords

EID: 0004694692     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169608804497     Document Type: Article

References (26)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, Dover Publications, 1965.
2. A. Bonnin and J. M. Pallo, A-transformation dans les arbres n-aires, Discrete Mathematics, 45 (1983), 153-163.
3. A. Bonnin and J. M. Pallo, A shortest path metric on unlabeled binary trees, Pattern Recognition Letters, 13 (1992), 411-415.
4. A. Cayley, On the partitions of a polygon, Proceedings of the London Mathematical Society, 22 (1891) 237-262.
5. N. Dershowitz and S. Zaks, Enumeration of ordered trees, Discrete Mathematics, 31 (1980), 9-28.
6. P. H. Edelman, Chain enumeration and noncrossing partitions, Discrete Mathematics, 31 (1980), 171-180.
7. H. Friedman and D. Tamari, Problèmes d'associativité: une structure de treillis fini induite par une loi demi-associative, J.Combinatorial Theory, 2 (1967), 215-242.
8. C. Germain, Thèse de l'Université de Bourgogne, 1996.
9. W. Geyer, On Tamari lattices, Discrete Mathematics, 133 (1994), 99-122.
10. P. Hilton and J. Pedersen, Catalan numbers, their generalization and their uses, The Mathematical Intelligencer, 13 (1991), 64-75.
11. S. Huang and D. Tamari, Problems of associativity:a simple proof for the lattice property of systems ordered by a semi-associative law, J.Combinatorial Theory (A), 13(1972), 7-13.
12. T. P. Kirkman, On the K-partitions of the R-gon and the R-ace, Philosophical Transactions of the Royal Society of London, 147 (1857), 217-272.
13. G. Kreweras, Sur les partitions non croisées d'un cycle, Discrete Mathematics, 1 (1972), 333-350.
14. C. Lanczos, Applied Analysis,Prentice-Hall Mathematical Series, 1964.
15. G. Markowsky, Primes, irreducibles and extremal lattices, Order, 9 (1992), 265-290.
16. J. M. Pallo, Some properties of the rotation lattice of binary trees. The Computer Journal, 31 (1988), 564-565.
17. J. M. Pallo, Une bijection entre arbres binaires et certaines matrices de Jacobi, Discrete Mathematics, 103 (1992), 99-101.
18. J. M. Pallo, An algorithm to compute the Möbius function of the rotation lattice of binary trees, RAIRO Informatique Théorique et Applications, 27 (1993), 341-348.
19. J. M. Pallo and R. Racca, A note on generating binary trees in A-order and B-order, Int.J.Computer Mathematics,18 (1985), 27-39.
20. D. Rubenstein, Catalan numbers revisited, J.Combinatorial Theory (A), 68 (1994), 486-490.
21. F. Ruskey and A. Proskurowski, Generating binary trees by transpositions, Journal of Algorithms, 11 (1990), 68-84.
22. R. Simion and D. Ullman, On the structure of the lattice of noncrossing partitions, Discrete Mathematics, 98 (1991), 193-206.
23. D. D. Sleator, R. E. Tarjan and W. P. Thurston, Rotation distance, triangulations and hyperbolic geometry, Journal of the American Mathematical Society,1 (1988), 647-681.
24. N. J. A. Sloane, A Handbook of integer Sequences, Academic Press, 1973.
25. A. Urquhart, A topologial representation theory for lattices, Algebra Universalis, 8 (1978), 45-58.
26. X. G. Viennot, Enumerative combinatorics and computer science, STACS'90, Proceedings, Lecture Notes in Computer Science no415 (1990), 278-284.