The skew-length generating-function conjecture for core partitions
Let be coprime. For an -core partition , let be its number of nonzero rows. Define its skew length to be the number of boxes simultaneously in its -boundary, consisting of boxes with hook lengths less than , and in its -rows, obtained by selecting the highest row in each residue class modulo among the hook lengths of boxes in the first column. Skew-length generating-function conjecture.
where the sum is over -cores . This conjecturally supplies a statistic solving the preceding -Catalan problem; its relation to known major-index statistics in the classical Catalan case is unclear, and the source expects the conjecture to be difficult.
References
- Drew Armstrong, Christopher R. H. Hanusa and Brant C. Jones, “Results and conjectures on simultaneous core partitions”, arXiv:1308.0572 (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
No solutions have been posted yet.