Order ideal cardinality homomesy for odd uniform self-dual fences

Let aa be a positive integer, let tt be odd, and let F=F˘(at)F=\breve{F}(a^t) be the uniform self-dual fence with tt segments. Write n=#Fn=\#F for its number of elements, and let χ^\hat{\chi} be the order ideal cardinality statistic. Order ideal cardinality conjecture. The statistic χ^\hat{\chi} is n/2n/2-mesic under rowmotion.

The source explains that this conjecture is equivalent to a 0-mesy statement involving peak and valley antichain indicators, and records computational confirmation for several parameter ranges.

Sources & referencesView supporting material

Primary source

Alec Mertin and Svetlana Poznanović, “Toggleability Spaces of Fences”, arXiv:2406.02493 (2024).

Progress summary

Never refreshed

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.