Homomesies on permutations -- an analysis of maps and statistics in the FindStat database
Preprint
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. Beside 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
All Related Versions
This publication has 14 references indexed in Scilit:
- A central limit theorem for a new statistic on permutationsIndian Journal of Pure and Applied Mathematics, 2017
- Dynamical Algebraic Combinatorics: Promotion, Rowmotion, and ResonanceNotices of the American Mathematical Society, 2017
- The writhe of permutations and random framed knotsRandom Structures & Algorithms, 2016
- 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
- Major Index and Inversion Number of PermutationsMathematische Nachrichten, 1978