The extension-weight conjecture for strict partitions
The extension-weight conjecture for strict partitions
Let be a strict partition, let , and let be a filling. Let be the set of fillings of the diagram of extending , and let denote their stationary weights. Then Extension-weight conjecture.
This would provide a combinatorial proof of the reduced partition-function result for strict partitions by showing that the extension factor is independent of . 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.