Rank-factorization conjecture for the polynomials
Rank-factorization conjecture for the polynomials
Let be a partition, and let its rank be the size of its Durfee square. Write for the polynomial associated with . Computations indicate that these polynomials have factors of the form .
Rank-factorization conjecture. For any partition of rank , there is a polynomial such that
Equivalently, is divisible by each of the displayed linear factors.
The conjecture specifies the linear factors of in terms of the Durfee-square rank of . It was motivated by computations for small partitions and has been verified for all partitions of size at most ; the general statement remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Ian Cavey and Yi-Lin Lee, “Domino Tilings, Domino Shuffling, and the Nabla Operator”, arXiv:2501.17765 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.