Möbius functions of lattices

Advances in Mathematics

Volumn 127, Issue 1, 1997, Pages 94-123

  Blass, Andreas ^a   Sagan, Bruce E ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031569693     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1006/aima.1997.1616     Document Type: Article

References (26)

1. Athanasiadis C. A. Algebraic Combinatorics of Graph Spectra, Subspace Arrangements and Tutte Polynomials. 1996;M.I.T.
2. Björner A. Subspace arrangements. Prog. Math. 122:1994;321-370.
3. Björner A., Lovász L. Linear decision trees, subspace arrangements and Möbius functions. J. Amer. Math. Soc. 7:1994;677-706.
4. A. Björner, L. Lovász, A. Yao, 1992, Linear decision trees: volume estimates and topological bounds, Proceedings of the Twenty-Fourth ACM Symposium on Theory of Computing, 170, 177, ACM Press, New York, NY.
5. K. Bogart, 1972, The Möbius function of the domination lattice.
6. Brylawski T. The lattice of integer partitions. Discrete Math. 6:1793;201-219.
7. De Concini C., Procesi C. Wonderful models of subspace arrangements. Selecta Math. 1:1995;459-494.
8. Edelman P. H., Reiner V. The higher Stasheff-Tamari posets. Mathematika. 43:1996;127-154.
9. Friedman H., Tamari D. Problèmes d'associativité: Une treillis finie induite par une loi demi-associative. J. Combin. Theory. 2:1967;215-242.
10. Geyer W. On Tamari lattices. Discrete Math. 133:1994;99-122.
11. Grätzer G. Lattice Theory. 1971;Freeman and Co. San Francisco.
12. Greene C. A class of lattices with Möbius function ±1. European J. Combin. 9:1988;225-240.
13. Greene C. Posets of Shuffles. J. Combin. Theory Ser. A. 47:1988;191-206.
14. Huang S., Tamari D. Problems of associativity: A simple proof for the lattice property of systems ordered by a semi-associative law. J. Combin. Theory Ser. A. 13:1972;7-13.
15. Kreweras G. Sur les partitions non-croisées d'un cycle. Discrete Math. 1:1972;333-350.
16. S. Linusson, A class of lattices whose intervals are spherical or contractible.
17. Markowsky G. Primes, irreducibles and extremal lattices. Order. 9:1992;7-13.
18. Orlik P., Solomon L. Combinatorics and topology of complements of hyperplanes. Invent. Math. 56:1980;167-189.
19. V. Reiner, Non-crossing partitions for classical reflection groups, Discrete Math.
20. Rota G.-C. On the foundations of combinatorial theory I. Theory of Möbius functions. Z. Wahrscheinlichkeitstheorie. 2:1964;340-368.
21. Sagan B. E. A generalisation of Rota's NBC Theorem. Adv. in Math. 111:1995;195-207.
22. Y. Segev, The simplicial complex of all NBB nonspanning subsets of the set of atoms of a prelatticeLL, European J. Combin.
23. Stanley R. P. Supersolvable lattices. Alg. Univ. 2:1972;197-217.
24. Stanley R. P. Enumerative Combinatorics, Volume 1. 1986;Wadsworth & Brooks/Cole, Pacific Grove.
25. Whitney H. A logical expansion in mathematics. Bull. Amer. Math. Soc. 38:1932;572-579.
26. Zaslavsky T. The geometry of root systems and signed graphs. Amer. Math. Monthly. 88:1981;88-105.