Stirling permutations, cycle structure of permutations and perfect matchings (Q907233): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1503.06601 / rank | |||
Normal rank | |||
Revision as of 17:53, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stirling permutations, cycle structure of permutations and perfect matchings |
scientific article |
Statements
Stirling permutations, cycle structure of permutations and perfect matchings (English)
0 references
25 January 2016
0 references
Summary: In this paper we provide constructive proofs that the following three statistics are equidistributed: the number of ascent plateaus of Stirling permutations of order \(n\), a weighted variant of the number of excedances in permutations of length \(n\) and the number of blocks with even maximal elements in perfect matchings of the set \(\{1,2,3,\dots,2n\}\).
0 references
Stirling permutations
0 references
excedances
0 references
perfect matchings
0 references
Eulerian polynomials
0 references
