The excedance set of a permutation

From MaRDI portal





A permutation \(w_1,w_2,\dots, w_n\) of \(1,2,\dots, n\) has an excedance at position \(i\) if \(w_i>i\), the excedance set of a permutation is the set of positions with excedance. The paper gives a formula for the number of permutations with a given excedance set, and recurrences for these quantities. It is shown that the most common excedance set for all permutations of \(n\) elements is \(\{1,2,\dots,\lfloor n/2\rfloor\}\). A log-concavity result for certain excedance numbers is proved. Stirling numbers of the second kind and Genocchi numbers are related to excedance set problems.




Cited in
(30)








This page was built for publication: The excedance set of a permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586921)