Factorization of the Characteristic Polynomial - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2014

Factorization of the Characteristic Polynomial

Résumé

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
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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

TDS-MACS
48 Consultations
1330 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More