The two-rectangle conjecture for Jack characters
The two-rectangle conjecture for Jack characters
Let be a multirectangular Young diagram consisting of at most two rectangles, and let and the orientability generating series be as in the measure-of-non-orientability conjecture. The two-rectangle conjecture. The measure-of-non-orientability conjecture is true for every such multirectangular Young diagram . The assertion would yield explicit formulas for the quadratic terms of Kerov polynomials for Jack characters; the source reports computer evidence but does not establish it.
Sources & referencesView supporting material
Primary source
Maciej Dołęga, Valentin Féray and Piotr Śniady, “Jack polynomials and orientability generating series of maps”, arXiv:1301.6531 (2014).
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.