Factorization of the Characteristic Polynomial - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

Factorization of the Characteristic Polynomial

Abstract

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.
Fichier principal
Vignette du fichier
dmAT0112.pdf (254.28 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01207579 , version 1 (01-10-2015)

Identifiers

Cite

Joshua Hallam, Bruce E. Sagan. Factorization of the Characteristic Polynomial. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.125-136, ⟨10.46298/dmtcs.2386⟩. ⟨hal-01207579⟩

Collections

INSMI TDS-MACS
46 View
1173 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More