The extension-weight conjecture for strict partitions

Let o^ˊi~\tilde{\boldsymbol{ối}} be a strict partition, let nNn\in\mathbb{N}, and let σTab(\bo^ˊi~c,n)\sigma\in\operatorname{Tab}(\tilde{\boldsymbol{\bối}}^{\mathrm{c}},n) be a filling. Let Extb~(σ)\operatorname{Ext}_{\tilde{\boldsymbol{b}}}(\sigma) be the set of fillings of the diagram of b~\tilde{\boldsymbol{b}} extending σ\sigma, and let wt\operatorname{wt} denote their stationary weights. Then Extension-weight conjecture.

1wt(σ)TExtb~(σ)wt(T)=H~b~(x1,,xn;1,t)H~b~c(x1,,xn;1,t).\frac{1}{\operatorname{wt}(\sigma)}\sum_{T\in\operatorname{Ext}_{\tilde{\boldsymbol{b}}}(\sigma)}\operatorname{wt}(T)=\frac{\widetilde{H}_{\tilde{\boldsymbol{b}}}(x_1,\dots,x_n;1,t)}{\widetilde{H}_{\tilde{\boldsymbol{b}}^{\mathrm{c}}}(x_1,\dots,x_n;1,t)}.

This would provide a combinatorial proof of the reduced partition-function result for strict partitions by showing that the extension factor is independent of σ\sigma. The paper presents it as a refined conjecture and supplies no proof.

Sources & referencesView supporting material

Primary source

Arvind Ayyer, Olya Mandelshtam and James B. Martin, “Modified Macdonald polynomials and the multispecies zero range process: II”, arXiv:2209.09859 (2025).

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.