Dumont's statistic on words (Q1596197)

It is well known that the number of permutations in the symmetric group \(S_n\) with \(k\) descents is equal to the Euler number \(A_{n,k}\). A similar property holds for many other natural permutation statistics \(\text{stat}: S_n\rightarrow N\). Namely, a statistic is called Eulerian if \(|\{ \pi\in S_n:\text{stat}(\pi)=k\}|=A_{n,k}\). In particular, \textit{D. Dumont} introduced [Duke Math. J. 41, 305-318 (1974; Zbl 0297.05004)] a statistic which maps a permutation to the number of distinct nonzero letters in its code, and showed that it is Eulerian. In the paper under review Dumont's statistic is extended to rearrangement classes of arbitrary words. This generalized Dumont's statistic occurs to be again Eulerian. As a consequence, the author shows that for each distributive lattice \(J(P)\) which is a product of chains, there is a poset \(Q\) such that the \(f\)-vector of \(Q\) is the \(h\)-vector of \(J(P)\).