Stirling permutations, cycle structure of permutations and perfect matchings (Q907233)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stirling permutations, cycle structure of permutations and perfect matchings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9153873
0 references
0 references
0.90046835
0 references
0.8972132
0 references
0.8944236
0 references
0.89401656
0 references
0 references
