The circular fence poset block-statistic conjecture

Let PP be a circular fence poset of size nn, let Sn(P)S_n(P) denote the relevant set of permutations, and let bl^P(σ)\widehat{bl}_P(\sigma) be the block statistic introduced for circular fence posets. Here Ω(P;t)\Omega(P;t) is the order polynomial of PP. Circular fence block-statistic conjecture. For every circular fence poset PP of size nn,

n!Ω(P;t)=σSn(P)tbl^P(σ).n! \, \Omega(P;t)=\sum_{\sigma\in S_n(P)}t^{\widehat{bl}_P(\sigma)}.

This conjecture seeks a combinatorial interpretation of the coefficients of the order polynomial for circular fence posets, parallel to the established formula for ordinary fence posets. Its status is not specified in the source.

Sources & referencesView supporting material

Primary source

Yakob Kahane, “Combinatorial interpretation of the coefficients of the order polynomial of fence posets”, arXiv:2607.11225 (2026).

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.