Mobius functions of lattices
| dc.creator | Blass, Andreas | |
| dc.creator | Sagan, Bruce E. | |
| dc.date | 1998-01-02 | |
| dc.date.accessioned | 2026-07-07T05:23:29Z | |
| dc.date.available | 2026-07-07T05:23:29Z | |
| dc.description | 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 Möbius function in various examples including non-crossing set partitions, shuffle posets, and integer partitions in dominance order. Next we present a generalization of Stanley's theorem that the characteristic polynomial of a semimodular supersolvable lattice factors over the integers. We also give some applications of this second main theorem, including the Tamari lattices. | |
| dc.description | 29 pages, 6 figures, Latex, see related papers at http://www.math.msu.edu/~sagan | |
| dc.identifier | https://arxiv.org/abs/math/9801009 | |
| dc.identifier | http://arxiv.org/abs/math/9801009 | |
| dc.identifier | Adv. in Math. 127 (1997), 94-123 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76453 | |
| dc.subject | Combinatorics | |
| dc.subject | 06A07 (Primary) 06B99, 05A17, 05A18 (Secondary) | |
| dc.title | Mobius functions of lattices | |
| dc.type | text |