Max-minus-min homomesy conjecture for interval-closed sets of products of two chains
Let be the product of two chains, and let denote its interval-closed sets. Under rowmotion on , consider the statistic that assigns to each interval-closed set the number of its maximal elements minus the number of its minimal elements. A statistic is -mesic if its average on every rowmotion orbit is zero. Max-minus-min homomesy conjecture. The number of maximal elements minus the number of minimal elements is -mesic under rowmotion on , for .
This conjecture was posed in the cited earlier work; the source notes that the case was already proved there, while the general case remains open.
References
- Nadia Lafrenière, Joel Brewster Lewis, Erin McNicholas, Jessica Striker and Amanda Welch, “Interval-closed set rowmotion and homomesy on products of two chains”, arXiv:2505.04000 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.