The d-complete poset hook-length bijection conjecture

About 16 years old · traced to

Let PP) be a dd-complete poset and let cc be a minimal element. Define Ac(G)={z∈P:c∈H‾z}A_c(G)=\{z\in P:c\in\overline H_z\} for G∈GcG\in\mathcal{G}_c, and let Gck\mathcal{G}_c^k denote the elements of Gc\mathcal{G}_c having exactly kk fixed points. There exist maps

s=sc:P(Ac)→P,s=s_c:\mathcal{P}(A_c)\to P,

extended to s:Gc→Ps:\mathcal{G}_c\to P by s(G)=s(Ac(G))s(G)=s(A_c(G)), and a map e=ec:Gc→Gce=e_c:\mathcal{G}_c\to\mathcal{G}_c satisfying the following properties.

The d-complete poset hook-length bijection conjecture. If G∈Gc0G\in\mathcal{G}_c^0, then s(G)=cs(G)=c and e(G)=Ge(G)=G; if G∈GckG\in\mathcal{G}_c^k for k≥1k\geq1, then e(G)∈Gck−1e(G)\in\mathcal{G}_c^{k-1}. If G∈GckG\in\mathcal{G}_c^k for k≥1k\geq1, then e(G)s(G)=s(e(G))e(G)_{s(G)}=s(e(G)); moreover, if z≱s(G)z\not\geq s(G), then e(G)z=Gze(G)_z=G_z. Finally, given G′∈GckG'\in\mathcal{G}_c^k and zz such that Gz′=s(G′)G'_z=s(G'), there is exactly one G∈Gck+1G\in\mathcal{G}_c^{k+1} satisfying s(G)=zs(G)=z and e(G)=G′e(G)=G'.

These maps would provide a bijective proof of the hook-length formula for dd-complete posets by organizing the relevant objects according to their number of fixed points. The conjecture concerns the existence of the stated raising and lowering structure and remains open in the source.

References

Primary source

Matjaz Konvalinka, “The weighted hook length formula III: Shifted tableaux”, arXiv:1006.4593 (2010).

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.