Asymptotic form conjecture for partitions of a 3-row rectangle
Asymptotic form conjecture for partitions of a 3-row rectangle
Let denote the number of partitions of a rectangle into permitted rectangular blocks, as defined in the paper. Asymptotic form conjecture. There exist constants and such that
The conjecture is motivated by the established asymptotic for and predicts an analogous exponential-polynomial asymptotic for partitions of a rectangle. No resolution is supplied in the source.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Krystian Gajdzica, Robin Visser and Maciej Zakarczemny, “Rectangle partitions generalizing integer partitions”, arXiv:2509.20495 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.