Factorization of the Characteristic Polynomial
2014 ◽
Vol DMTCS Proceedings vol. AT,...
(Proceedings)
◽
Keyword(s):
International audience We introduce a new method for showing that the roots of the characteristic polynomial of a finite lattice are all nonnegative integers. Our method gives two simple conditions under which the characteristic polynomial factors. We will see that Stanley's Supersolvability Theorem is a corollary of this result. We can also use this method to demonstrate a new result in graph theory and give new proofs of some classic results concerning the Möbius function.
1987 ◽
Vol 101
(2)
◽
pp. 221-231
◽
Keyword(s):
2015 ◽
Vol DMTCS Proceedings, 27th...
(Proceedings)
◽
Keyword(s):
2020 ◽
Vol DMTCS Proceedings, 28th...
◽
2008 ◽
Vol DMTCS Proceedings vol. AJ,...
(Proceedings)
◽
Keyword(s):
2012 ◽
Vol DMTCS Proceedings vol. AR,...
(Proceedings)
◽
Keyword(s):
1994 ◽
Vol 35
(6)
◽
pp. 3099-3108
◽
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
Keyword(s):