JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 25, Number 3, July 2012, Pages 907–927 S 0894-0347(2012)00731-0 Article electronically published on February 8, 2012
MILNOR NUMBERS OF PROJECTIVE HYPERSURFACES AND THE CHROMATIC POLYNOMIAL OF GRAPHS
JUNE HUH
1. Introduction
George Birkhoff introduced a function χG(q), defined for all positive integers q and a finite graph G, which counts the number of proper colorings of G with q colors.Asitturnsout,χG(q)isapolynomialinq with integer coefficients, called the chromatic polynomial of G. Recall that a sequence a0,a1,...,an of real numbers is said to be unimodal if for some 0 ≤ i ≤ n,
a0 ≤ a1 ≤···≤ai−1 ≤ ai ≥ ai+1 ≥···≥an, and is said to be log-concave if for all 0
n n−1 n Conjecture 1. Let χG(q)=anq − an−1q + ···+(−1) a0 be the chromatic polynomial of a graph G. Then the sequence a0,a1,...,an is log-concave. Read [31] conjectured in 1968 that the above sequence is unimodal. Soon after Rota, Heron, and Welsh formulated the conjecture in a more general context of matroids [33, 14, 48]. Let M be a matroid and L be the lattice of flats of M with the minimum 0.ˆ The characteristic polynomial of M is defined to be rank(M)−rank(x) χM (q)= μ(0ˆ,x)q , x∈L where μ is the M¨obius function of L . We refer to [27, 48] for general background on matroids.
Received by the editors July 10, 2011 and, in revised form, January 17, 2012. 2010 Mathematics Subject Classification. Primary 14B05, 05B35. Key words and phrases. Chern-Schwartz-MacPherson class, characteristic polynomial, chro- matic polynomial, Milnor number, Okounkov body. The author acknowledges support from National Science Foundation grant DMS 0838434 “EMSW21-MCTP: Research Experience for Graduate Students”.