Conjectural combinatorial formula for the parabolic H-triangle

For positive integers m,n,tm,n,t, let NNn,t(m)\operatorname{\bf NN}_{n,t}^{(m)} be the set of geometric multi-chains of tt-filters. For VNNn,t(m)\mathcal V\in\operatorname{\bf NN}_{n,t}^{(m)}, let FL(V)\operatorname{FL}(\mathcal V) denote its set of colored floors, let Sn,t={(t,t+1),(t+1,t+2),,(n1,n)}S_{n,t}=\{(t,t+1),(t+1,t+2),\ldots,(n-1,n)\}, and define

H~n,t(m)(x,y)=VNNn,t(m)xFL(V)yFL(V)Sn,t.\tilde H_{n,t}^{(m)}(x,y)=\sum_{\mathcal V\in\operatorname{\bf NN}_{n,t}^{(m)}}x^{|\operatorname{FL}(\mathcal V)|}y^{|\operatorname{FL}(\mathcal V)\cap S_{n,t}|}.

Combinatorial HH-triangle conjecture. For positive integers m,n,tm,n,t,

H~n,t(m)(x,y)=Hn,t(m)(x,y)\tilde H_{n,t}^{(m)}(x,y)=H_{n,t}^{(m)}(x,y)

with

H~n,t(m)(x,y)=k=0nth=0ntk((mnt+1k)(t+k+h2h)m(mntk1)(t+k+h1h))xntkyntkh.\tilde H_{n,t}^{(m)}(x,y)=\sum_{k=0}^{n-t}\sum_{h=0}^{n-t-k}\left(\binom{mn-t+1}{k}\binom{t+k+h-2}{h}-m\binom{mn-t}{k-1}\binom{t+k+h-1}{h}\right)x^{n-t-k}y^{n-t-k-h}.

This asserts that the generating polynomial obtained from geometric multi-chains of tt-filters equals the previously defined parabolic HH-triangle. The supplied text does not state whether the identity has been proved or disproved.

Sources & referencesView supporting material

Primary source

Christian Krattenthaler and Henri Mühle, “The Rank Enumeration of Certain Parabolic Non-Crossing Partitions”, arXiv:1910.13244 (2022).

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.