Möbius functions of lattices

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-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 super-solvable lattice factors over the integers. We also give some applications of this second main theorem, including the Tamari lattices. 1997 Academic Press 1. BOUNDED BELOW SETS In a fundamental paper [25], Whitney showed how broken circuits could be used to compute the coefficients of the chromatic polynomial of a graph. In another seminal paper [20], Rota refined and extended Whitney’s theorem to give a characterization of the Mo bius function of a geometric lattice. Then one of us [21] generalized Rota’s result to a larger class of lattices. In this paper we will present a theorem for an arbitrar