Rank-alternating homomesy conjecture for bounded labelings of the type A positive root poset
Rank-alternating homomesy conjecture for bounded labelings of the type A positive root poset
Let be the type A positive root poset, with rank function for minimal elements, and let be the set of labelings under the toggle-promotion operator . Define the rank-alternating label sum by
Rank-alternating homomesy conjecture. The triple is -mesic when is even and -mesic when is odd.
The authors checked this for and ; the case was proved by S. Haddadan. The conjecture concerns homomesy of the rank-alternating statistic under toggle-promotion and remains open in general.
Sources & referencesView supporting material
Primary source
Joseph Bernstein, Jessica Striker and Corey Vorland, “P-strict promotion and B-bounded rowmotion, with applications to tableaux of many flavors”, arXiv:2012.12219 (2021).
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
Sign in to submit a solution.
No solutions have been posted yet.