Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bayer, D., Diaconis, P.: Trailing the dovetail to its lair. Ann. Appl. Probab. 2(2), 294–313 (1992)
Chatterjee, S., Diaconis, P.: A central limit theorem for a new statistic on permutations. Indian J. Pure Appl. Math. 48(4), 561–573 (2017)
Chen, W.Y.C., Deng, E.Y.P., Du, R.R.X., Stanley, R.P., Yan, C.H.: Crossings and nestings of matchings and partitions. Trans. Amer. Math. Soc. 359(4), 1555–1575 (2007)
Curtiss, J.H.: A note on the theory of moment generating functions. Ann. Math. Statist. 13, 430–433 (1942)
Diaconis, P., McGrath, M., Pitman, J.: Riffle shuffles, cycles, and descents. Combinatorica 15(1), 11–29 (1995)
Diaconis, P., Pitman, J.: Unpublished notes on descents
Fulman, J.: The distribution of descents in fixed conjugacy classes of the symmetric group. J. Combin. Theory Ser. A 84(2), 171–180 (1998)
Fulman, J.: Stein’s method and non-reversible Markov chains. In: Diaconis, P., Holmes, S. (eds.) Stein’s Method: Expository Lectures and Applications, IMS Lecture Notes Monogr. Ser., Vol. 46, pp. 69–77. Inst. Math. Statist., Beachwood, OH (2004)
Fulton, W.: Young Tableaux. With Applications to Representation Theory and Geometry. London Mathematical Society Student Texts, 35. Cambridge University Press, Cambridge (1997)
Garsia, A.M., Gessel, I.: Permutation statistics and partitions. Adv. Math. 31(3), 288–305 (1979)
Gessel, I.M., Reutenauer, C.: Counting permutations with given cycle structure and descent set. J. Combin. Theory Ser. A 64(2), 189–215 (1993)
Goldstein, L., Rinott, Y.: A permutation test for matching and its asymptotic distribution. Metron 61(3), 375–388 (2004)
Harper, L.H.: Stirling behavior is asymptotically normal. Ann. Math. Statist. 38, 410–414 (1966)
Knuth, D.E.: The Art of Computer Programming. Vol. 3. Sorting and Searching. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont. (1973)
Petersen, T.K.: Eulerian Numbers. Birkhäuser Advanced Texts: Basler Lehrbücher. Birkhäuser/Springer, New York (2015)
Schützenberger, M.: La correspondance de Robinson. Lecture Notes in Math. 579, 59–113 (1979)
Sundaram, S.: The Cauchy identity for \({\rm Sp}(2n)\). J. Combin. Theory Ser. A 53(2), 209–238 (1990)
Vatutin, V.A.: The numbers of ascending segments in a random permutation and in one inverse to it are asymptotically independent. Discrete Math. Appl. 6(1), 41–52 (1996)
Acknowledgements
The author would like to thank Brendon Rhoades for introducing the author to the world of Young tableaux and helping come up with the bijection in Sect. 3. The author would also like to thank Sangchul Lee for the suggestion of considering moment generating functions instead of characteristic functions and helping with the calculations of bounding the integrals in Sect. 4. Finally, the author would like to thank Jason Fulman for the suggestion of the problem and his guidance.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kim, G.B. Distribution of Descents in Matchings. Ann. Comb. 23, 73–87 (2019). https://doi.org/10.1007/s00026-019-00414-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-019-00414-1