The real-rootedness and log-concavities of coordinator polynomials of Weyl group lattices (Q691600)

Given a lattice \({\mathcal L} \subset {\mathbb R}^n\), we say that it is \textit{generated as a monoid} by a finite collection of vectors \(M \subset {\mathcal L}\) if each point in \(\mathcal L\) is a nonnegative integer combination of the vectors in \(M\). The \textit{word length} of a point in \(\mathcal L\) is the minimal number of vectors in \(M\) (counted with multiplicity) needed to write the point as such a combination. The \textit{growth series} of \(\mathcal L\) (with respect to \(M\)) is the generating function of the word-length function. It is a rational function \(G(x)= {{h(x)} \over {(1-x)^d}}\) where \(h(x)\) is a polynomial of degree less than or equal to the rank \(d\) of \(\mathcal L\). We call \(h(x)\) the \textit{coordinator polynomial} of~\(\mathcal L\). The paper under review studies the growth series for the classical root lattices \(A_n\), \(B_n\), \(C_n\) and \(D_n\), generated as monoids by their standard set of generators; their coordinator polynomials are known [\textit{J. H. Conway} and \textit{N. J. A. Sloane}, Proc. R. Soc. Lond., Ser. A 453, No. 1966, 2369--2389 (1997; Zbl 1066.11505)], [\textit{R. Bacher} et al., C. R. Acad. Sci., Paris, Sér. I, Math. 325, No. 11, 1137--1142 (1997; Zbl 0917.52006)]. The authors prove that all coordinator polynomials of these lattices except for \(B_n\) are real rooted (and \(B_{16}\) is an example showing that this does not hold for the \(B_n\)-lattices) and that the coordinator polynomials for \(B_n\) is log concave. (A polynomial is \textit{log concave} if its coefficients \(c_j\) satisfy \(c_j^2 > c_{ j-1 } c_{ j+1 }\); any polynomial with only real roots is log concave.)