The d-complete poset hook-length bijection conjecture
The d-complete poset hook-length bijection conjecture
Let ) be a -complete poset and let be a minimal element. Define for , and let denote the elements of having exactly fixed points. There exist maps
extended to by , and a map satisfying the following properties.
The d-complete poset hook-length bijection conjecture. If , then and ; if for , then . If for , then ; moreover, if , then . Finally, given and such that , there is exactly one satisfying and .
These maps would provide a bijective proof of the hook-length formula for -complete posets by organizing the relevant objects according to their number of fixed points. The conjecture concerns the existence of the stated raising and lowering structure and remains open in the source.
Sources & referencesView supporting material
Primary source
Matjaz Konvalinka, “The weighted hook length formula III: Shifted tableaux”, arXiv:1006.4593 (2010).
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.