We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain the Mo bius function in various examples including non-cross
The Möbius function of factor order
✍ Scribed by Anders Björner
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 523 KB
- Volume
- 117
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let 5 be a family of subsets of an n-set, considered as a subposet of the Boolean algebra B.. Adjoin a minimum 0 and maximum i if necessary to form @. Let ~(95) denote the value of the Mdbius function p(6,i) in &. We compute the maximum value of Ip( as 9 ranges over three types of families in B,: lo
For p # (0, 1), let Q p (Q p, 0 ) be the space of analytic functions f on the unit disk , where &} & D p means the weighted Dirichlet norm and . w is the Mo bius map of 2 onto itself with . w (0)=w. In this paper, we prove the Corona theorem for the algebra then we provide a Fefferman Stein type d