We define Dumont’s statistic on the symmetric group Sn to be the function dmc: Sn → N which maps a permutation σ to the number of distinct nonzero letters in code(σ). Dumont showed that this statistic is Eulerian. Naturally extending Dumont’s statistic to the rearrangement classes of arbitrary words, we create a generalized statistic which is again Eulerian. As a consequence, we show that for e...