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
✦ LIBER ✦
The Möbius function and connected graphs
✍ Scribed by C.C Cadogan
- Publisher
- Elsevier Science
- Year
- 1971
- Tongue
- English
- Weight
- 284 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Möbius Functions of Lattices
✍
Andreas Blass; Bruce E. Sagan
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 412 KB
Exponential sums involving the Möbius fu
✍
T. Zhan; J.-Y. Liu
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 329 KB
The Möbius function of factor order
✍
Anders Björner
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 523 KB
Posets with maximal Möbius function
✍
Günter M Ziegler
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 872 KB
Bounded Functions in Möbius Invariant Di
✍
Artur Nicolau; Jie Xiao
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 557 KB
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
The Möbius Inverse Monoid
✍
Mark V. Lawson
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 163 KB