Stirling permutations, cycle structures of permutations and perfect matchings
classification
🧮 math.CO
keywords
permutationscombinatorialcyclematchingsmy-sequencesperfectstirlingstructures
read the original abstract
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular, we discover that the Eulerian polynomials have a simple combinatorial interpretation in terms of some statistics on MY-sequences.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.