Distribution of Descents in Matchings

Annals of Combinatorics(2019)

引用 6|浏览1
暂无评分
摘要
The distribution of descents in certain conjugacy classes of S_n has been previously studied, and it is shown that its moments have interesting properties. This paper provides a bijective proof of the symmetry of the descents and major indices of matchings (also known as fixed point free involutions) and uses a generating function approach to prove an asymptotic normality theorem for the number of descents in matchings.
更多
查看译文
关键词
Enumerative combinatorics,Probabilistic combinatorics,Central limit theorem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要