





















We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit $O$ is said to be orbitmesic with respect to a statistic if the orbit's average statistic value is equal to the global average. We particularly focus on the action of promotion on increasing labelings of certain fence posets called zig-zag posets, and two statistics, the antipodal sum statistic and the total sum statistic. We classify all of the orbitmesic promotion orbits for the zig-zag poset with four elements. Along the way, we investigate how homomesy of one action can be used to find orbitmesic orbits for another action, for the same fixed statistic. We prove several general results which can be used to find infinite families of orbitmesic orbits for any self-dual poset.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。