A recursion formula for finite partition lattices
HTML articles powered by AMS MathViewer
- by Terrence J. Brown
- Proc. Amer. Math. Soc. 22 (1969), 124-126
- DOI: https://doi.org/10.1090/S0002-9939-1969-0241307-3
- PDF | Request permission
References
- Garrett Birkhoff, Lattice theory, rev. ed., Amer. Math. Soc., Providence, R. I., 1966.
- Roberto Frucht W. and Gian-Carlo Rota, The Möbius function for partitions of a set, Scientia (Valparaíso) 122 (1963), 111–115 (Spanish, with English summary). MR 191828
- Gian-Carlo Rota, On the foundations of combinatorial theory. I. Theory of Möbius functions, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2 (1964), 340–368 (1964). MR 174487, DOI 10.1007/BF00531932
- Gian-Carlo Rota, The number of partitions of a set, Amer. Math. Monthly 71 (1964), 498–504. MR 161805, DOI 10.2307/2312585
- M. P. Schützenberger, Contribution aux applications statistiques de la théorie de l’information, Publ. Inst. Statist. Univ. Paris 3 (1954), no. 1-2, 3–117 (French). MR 77816, DOI 10.1007/bf00930252
Bibliographic Information
- © Copyright 1969 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 22 (1969), 124-126
- MSC: Primary 05.04
- DOI: https://doi.org/10.1090/S0002-9939-1969-0241307-3
- MathSciNet review: 0241307