Mobius functions of lattices
Mobius functions of lattices
复制标题
格子的莫比乌斯函数
DOI:
10.1006/aima.1997.1616
复制
发表时间:
1997
影响因子:
1.7
通讯作者:
B. Sagan
中科院分区:
文献类型:
--
作者:
A. Blass;B. Sagan
Abstract 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 Mobius 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.