Why the characteristic polynomial factors
Abstract
Description
We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on Zaslavsky's theory of signed graphs. The second approach is algebraic and employs results of Saito and Terao about free hyperplane arrangements. Finally, we consider a purely combinatorial theorem of Stanley about semimodular supersolvable lattices and its generalizations.
28 pages, 4 figures, Latex, to be published in AMS Bulletin
28 pages, 4 figures, Latex, to be published in AMS Bulletin