Okada's -hook formula conjecture for connected -complete posets
Okada's -hook formula conjecture for connected -complete posets
Let be a connected -complete poset with maximum element , rank function , top tree , and -complete coloring . Let be obtained by adjoining a maximum element covering , with extended coloring . For a -partition , let extend by , and define by
where and . Here means that the colors are adjacent in the top tree. Okada's -hook formula conjecture. Using these notations,
This conjecture proposes a generating-function identity for weighted -partitions of connected -complete posets, extending the role of hook formulas in the theory of -partitions. The supplied text gives no evidence of resolution, so its status remains open.
Sources & referencesView supporting material
Primary source
Masao Ishikawa, “(q,t)-hook formula for Birds and Banners”, arXiv:1302.1968 (2013).
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.