Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Homomesy in products of two chains (1310.5201v6)

Published 19 Oct 2013 in math.CO

Abstract: Many invertible actions $\tau$ on a set ${\mathcal{S}}$ of combinatorial objects, along with a natural statistic $f$ on ${\mathcal{S}}$, exhibit the following property which we dub \textbf{homomesy}: the average of $f$ over each $\tau$-orbit in ${\mathcal{S}}$ is the same as the average of $f$ over the whole set ${\mathcal{S}}$. This phenomenon was first noticed by Panyushev in 2007 in the context of the rowmotion action on the set of antichains of a root poset; Armstrong, Stump, and Thomas proved Panyushev's conjecture in 2011. We describe a theoretical framework for results of this kind that applies more broadly, giving examples in a variety of contexts. These include linear actions on vector spaces, sandpile dynamics, Suter's action on certain subposets of Young's Lattice, Lyness 5-cycles, promotion of rectangular semi-standard Young tableaux, and the rowmotion and promotion actions on certain posets. We give a detailed description of the latter situation for products of two chains.

Citations (89)

Summary

We haven't generated a summary for this paper yet.

Youtube Logo Streamline Icon: https://streamlinehq.com