Dumont's statistic on words (Q1596197): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:25, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dumont's statistic on words |
scientific article |
Statements
Dumont's statistic on words (English)
0 references
8 February 2001
0 references
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)\).
0 references
permutation statistic
0 references
Eulerian statistic
0 references
\(f\)-vector
0 references
\(h\)-vector
0 references
Cohen-Macaulay complex
0 references
distributive lattice
0 references