Geodesic
Why the Characteristic Polynomial Factors
Séminaire lotharingien de combinatoire, Tome 35 (1995)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

We survey three methods for proving that the characteristic polynomial of a finite ranked lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is 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 supersolvable lattices and its generalizations. 

@article{SLC_1995_35_a0,
     author = {Bruce Sagan},
     title = {Why the {Characteristic} {Polynomial} {Factors}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {35},
     year = {1995},
     url = {http://geodesic.mathdoc.fr/item/SLC_1995_35_a0/}
}
TY  - JOUR
AU  - Bruce Sagan
TI  - Why the Characteristic Polynomial Factors
JO  - Séminaire lotharingien de combinatoire
PY  - 1995
VL  - 35
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1995_35_a0/
ID  - SLC_1995_35_a0
ER  - 
%0 Journal Article
%A Bruce Sagan
%T Why the Characteristic Polynomial Factors
%J Séminaire lotharingien de combinatoire
%D 1995
%V 35
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1995_35_a0/
%F SLC_1995_35_a0
Bruce Sagan. Why the Characteristic Polynomial Factors. Séminaire lotharingien de combinatoire, Tome 35 (1995). http://geodesic.mathdoc.fr/item/SLC_1995_35_a0/