Rooted quasi-Stirling permutations of general multisets
نویسندگان
چکیده
منابع مشابه
Stirling permutations on multisets
A permutation σ of a multiset is called Stirling permutation if σ(s) ≥ σ(i) as soon as σ(i) = σ(j) and i < s < j. In our paper we study Stirling polynomials that arise in the generating function for descent statistics on Stirling permutations of any multiset. We develop generalizations of the classical Stirling numbers and present their combinatorial interpretations. Particularly, we apply the ...
متن کاملLegendre - Stirling Permutations ∗ Eric
We first give a combinatorial interpretation of Everitt, Littlejohn, and Wellman’s Legendre-Stirling numbers of the first kind. We then give a combinatorial interpretation of the coefficients of the polynomial (1 − x) ∑∞ n=0 { n+k n } x analogous to that of the Eulerian numbers, where { n k } are Everitt, Littlejohn, and Wellman’s Legendre-Stirling numbers of the second kind. Finally we use a r...
متن کاملDenumerations of rooted trees and multisets
R\I stands for the set of positive integers, and li$, for the set of non-negative integers. If S is a set then IS( is the number of elements of S. If S is a set, then a multiset of elements of S is a mapping f of S into &, with the property that the set of s with f(s)>0 is finite. The set of all these multisets is denoted M(S). Some of our multisets are multisets of natural numbers. Number theo...
متن کاملStirling Permutations, Cycle Structure of Permutations and Perfect Matchings
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, . . . , 2n}.
متن کاملAnalysis of Statistics for Generalized Stirling Permutations
In this work we give a study of generalizations of Stirling permutations, a restricted class of permutations of multisets introduced by Gessel and Stanley [15]. First we give several bijections between such generalized Stirling permutations and various families of increasing trees extending the known correspondences of [20, 21]. Then we consider several permutation statistics of interest for ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Enumerative combinatorics and applications
سال: 2021
ISSN: ['2710-2335']
DOI: https://doi.org/10.54550/eca2022v2s2r16