vix.ing · top · new · best · stats · spec

Stirling permutations, cycle structures of permutations and perfect matchings

2015/03/23 by Shi-Mei Ma, Ma, Shi-Mei, Yeong‐Nan Yeh +1
Computer Science · Mathematics · #05A15 #05A19 #Advanced Combinatorial Mathematics #Bayesian Methods and Mixture Models #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1503.06601

openalex publication_date 2015/03/23 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28

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.

Citations

Related