Zeta-polynomial conjecture for m-divisible odd noncrossing partitions

About 8 years old · traced to

For m≥1m\geq 1, let C=(x1,x2,…,xm)C=(x_1,x_2,\ldots,x_m) be an mm-multichain in O ⁣N\C2n+1\mathcal{O\!N\C}_{2n+1}, with extended delta sequence δo(C)=(d0;d1,d2,…,dm)\delta_o(C)=(d_0;d_1,d_2,\ldots,d_m) defined by x0=ex_0=e, xm+1=cx_{m+1}=c, and di=xi−1xi+1d_i=x_i^{-1}x_{i+1}. Define O ⁣N\C2n+1(m)\mathcal{O\!N\C}_{2n+1}^{(m)} by C≤C′C\leq C' if and only if di≥3di′d_i\geq_{\mathbf{3}}d_i' for i∈[m]i\in[m]. Zeta-polynomial conjecture. For n,m≥1n,m\geq 1, the zeta polynomial of O ⁣N\C2n+1(m)\mathcal{O\!N\C}_{2n+1}^{(m)} is

Z(O ⁣N\C2n+1(m),q)=m(q−1)+1(2m(q−1)+1)n+m(q−1)+1((2m(q−1)+1)n+m(q−1)+1n).\mathcal{Z}\bigl(\mathcal{O\!N\C}_{2n+1}^{(m)},q\bigr)=\frac{m(q-1)+1}{(2m(q-1)+1)n+m(q-1)+1}\binom{(2m(q-1)+1)n+m(q-1)+1}{n}.

This conjecture gives an explicit enumeration of multichains in the mm-divisible odd noncrossing-partition poset; the source provides no resolution or further evidence.

References

Primary source

Henri Mühle and Philippe Nadeau, “A Poset Structure on the Alternating Group Generated by 3-Cycles”, arXiv:1803.00540 (2020).

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.