Amdeberhan's refined Nekrasov–Okounkov hook length conjecture
Amdeberhan's refined Nekrasov–Okounkov hook length conjecture
Let be a partition of , and let be its multiset of hook lengths. Let be the multiset of hook lengths with trivial legs. Amdeberhan's refinement. For every partition size and parameter ,
This conjecture refines the Nekrasov–Okounkov hook length formula. The paper proves it, so the identity is no longer open.
Sources & referencesView supporting material
Primary source
Bernhard Heim and Markus Neuhauser, “On conjectures regarding the Nekrasov–Okounkov hook length formula”, arXiv:1810.02226 (2018).
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
Sign in to submit a solution.
No solutions have been posted yet.