Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs (Q2892821)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs |
scientific article; zbMATH DE number 6049420
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs |
scientific article; zbMATH DE number 6049420 |
Statements
Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs (English)
0 references
25 June 2012
0 references
Chern-Schwartz-MacPherson class
0 references
chromatic polynomial
0 references
Milnor number
0 references
0 references
A sequence \(a_0, \dots, a_n\) of real numbers is called log-concave if \(a_{i-1}a_{i+1}\leq a_i^2\) for all \(i, 0<i<n\).NEWLINENEWLINEThe aim of the paper is to answer the following question.NEWLINENEWLINELet \(\chi_G(t)=a_nt^n-a_{n-1}t^{n-1}+\cdots +(-1)^n a_0\) be the chromatic polynomial of a graph \(G\). Is the sequence \(a_0, \dots, a_n\) log-concave? It is proved that for a matroid \(M\) which is representable over a field of characteristic zero the coefficients of the characteristic polynomial of \(M\) form a sign-alternating log-concave sequence of integers with no internal zeros.
0 references