Homomesies on permutations: An analysis of maps and statistics in the FindStat database
- 22 June 2023
- journal article
- research article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (346) , 921-976
Abstract
In this paper, we perform a systematic study of permutation statistics and bijective maps on permutations in which we identify and prove 122 instances of the homomesy phenomenon. Homomesy occurs when the average value of a statistic is the same on each orbit of a given map. The maps we investigate include the Lehmer code rotation, the reverse, the complement, the Foata bijection, and the Kreweras complement. The statistics studied relate to familiar notions such as inversions, descents, and permutation patterns, and also more obscure constructs. Besides the many new homomesy results, we discuss our research method, in which we used SageMath to search the FindStat combinatorial statistics database to identify potential homomesies.Keywords
Funding Information
- Simons Foundation ((527204)
- Simons Foundation (JS))
This publication has 17 references indexed in Scilit:
- Noncrossing partitions and Bruhat orderEuropean Journal of Combinatorics, 2016
- Fingerprint Databases for TheoremsNotices of the American Mathematical Society, 2013
- Lehmer code transforms and Mahonian statistics on permutationsDiscrete Mathematics, 2013
- Promotion and rowmotionEuropean Journal of Combinatorics, 2012
- The sorting order on a Coxeter groupJournal of Combinatorial Theory, Series A, 2009
- New Euler–Mahonian Statistics on Permutations and WordsAdvances in Applied Mathematics, 1997
- A New Statistics on Words1980
- Major Index and Inversion Number of PermutationsMathematische Nachrichten, 1978
- Sur les partitions non croisees d'un cycleDiscrete Mathematics, 1972
- On the Netto Inversion Number of a SequenceProceedings of the American Mathematical Society, 1968