期刊论文详细信息
Proceedings Mathematical Sciences
Enumerating Set Partitions According to the Number of Descents of Size 𝑑 or more
Mark Shattuck1  Toufik Mansour3  Chunwei Song2 
[1] School of Mathematical Sciences, LMAM, Peking University, Beijing 00, People’s Republic of China$$;$$;Department of Mathematics, University of Haifa, 0 Haifa, Israel$$
关键词: Set partitions;    descents;    partition statistic;    combinatorial proof.;   
DOI  :  
学科分类:数学(综合)
来源: Indian Academy of Sciences
PDF
【 摘 要 】

Let 𝑃(𝑛,𝑘) denote the set of partitions of ${1,2,ldots,n}$ having exactly 𝑘 blocks. In this paper, we find the generating function which counts the members of 𝑃(𝑛,𝑘) according to the number of descents of size 𝑑 or more, where 𝑑 ≥ 1 is fixed. An explicit expression in terms of Stirling numbers of the second kind may be given for the total number of such descents in all the members of 𝑃(𝑛,𝑘). We also compute the generating function for the statistics recording the number of ascents of size 𝑑 or more and show that it has the same distribution on 𝑃(𝑛,𝑘) as the prior statistics for descents when 𝑑 ≥ 2, by both algebraic and combinatorial arguments.

【 授权许可】

Unknown   

【 预 览 】
附件列表
Files Size Format View
RO201912040507006ZK.pdf 216KB PDF download
  文献评价指标  
  下载次数:6次 浏览次数:9次