Homomesies on permutations: An analysis of maps and statistics in the FindStat database

From MaRDI portal
Publication:6181105

DOI10.1090/MCOM/3866zbMATH Open1529.05167arXiv2206.13409OpenAlexW4376873643MaRDI QIDQ6181105FDOQ6181105


Authors: Jennifer Elder, Nadia Lafrenière, Erin McNicholas, Jessica Striker, Amanda Welch Edit this on Wikidata


Publication date: 2 January 2024

Published in: Mathematics of Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2206.13409




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Homomesies on permutations: An analysis of maps and statistics in the FindStat database

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181105)