Okada's (q,t)(q,t)-hook formula conjecture for connected dd-complete posets

Let PP be a connected dd-complete poset with maximum element v0v_0, rank function r:PNr:P\to\mathbb{N}, top tree TT, and dd-complete coloring c:PTc:P\to T. Let P^=P{1^}\widehat P=P\sqcup\{\widehat1\} be obtained by adjoining a maximum element 1^\widehat1 covering v0v_0, with extended coloring c^:P^T{1^}\widehat c:\widehat P\to T\sqcup\{\widehat1\}. For a PP-partition π\mathrsfsA(P)\pi\in\mathrsfs{A}(P), let π^\widehat\pi extend π\pi by π^(1^)=0\widehat\pi(\widehat1)=0, and define WP(π;q,t)W_P(\pi;q,t) by

WP(π;q,t)=x,yP^x<y, c^(x)c^(y)f(π(x)π(y);d(x,y))x,yPx<y, c(x)=c(y)f(π(x)π(y);e(x,y))f(π(x)π(y);e(x,y)1),W_{P}(\pi;q,t) =\frac{\displaystyle \prod_{{x,y\in\widehat P}\atop{x<y,\ \widehat c(x)\sim \widehat c(y)}} f(\pi(x)-\pi(y);d(x,y)) }{\displaystyle \prod_{{x,y\in P}\atop{x<y,\ c(x)=c(y)}} f(\pi(x)-\pi(y);e(x, y)) f(\pi(x)-\pi(y);e(x, y)-1) },

where d(x,y)=(r(y)r(x)1)/2d(x,y)=(r(y)-r(x)-1)/2 and e(x,y)=(r(y)r(x))/2e(x,y)=(r(y)-r(x))/2. Here c^(x)c^(y)\widehat c(x)\sim\widehat c(y) means that the colors are adjacent in the top tree. Okada's (q,t)(q,t)-hook formula conjecture. Using these notations,

π\mathrsfsA(P)WP(π;q,t)zπ=F(z[Hp];q,t).\sum_{\pi\in{\mathrsfs{A}}(P)} W_{P}(\pi;q,t)z^{\pi} =F\left(z[H_{p}];q,t\right).

This conjecture proposes a generating-function identity for weighted PP-partitions of connected dd-complete posets, extending the role of hook formulas in the theory of PP-partitions. The supplied text gives no evidence of resolution, so its status remains open.

Sources & referencesView supporting material

Primary source

Masao Ishikawa, “(q,t)-hook formula for Birds and Banners”, arXiv:1302.1968 (2013).

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.