Distribution of descents in matchings (Q2421312): Difference between revisions

Let \(S_n\) be the set of all permutations of \(n\) letters. A permutation \(\pi\in S_n\) has a descent at position \(i\) if \(\pi(i)>\pi(i+1)\), where \(i=1,\dots,n-1\). A matching (or a fixed point free involution) is a permutation \(\pi\in S_{2n}\) such that \(\pi^2=1\) and \(\pi(i)\neq i\) for all \(i=1,\dots,2n\). From the author's summary: ``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.''