Asymptotic form conjecture for partitions of a 3-row rectangle

About 1 year old · traced to

Let p(3,n)p(3,n) denote the number of partitions of a 3×n3\times n rectangle into permitted rectangular blocks, as defined in the paper. Asymptotic form conjecture. There exist constants k3,λ3>0k_3,\lambda_3>0 and δ3∈R\delta_3\in\mathbb{R} such that

p(3,n)∼k3nδ3exp⁡(λ3n) as n→∞.p(3,n)\sim k_3n^{\delta_3}\exp\bigl(\lambda_3\sqrt{n}\bigr)\text{ as }n\to\infty.

The conjecture is motivated by the established asymptotic for p(2,n)p(2,n) and predicts an analogous exponential-polynomial asymptotic for partitions of a 3×n3\times n rectangle. No resolution is supplied in the source.

References

Primary source

Krystian Gajdzica, Robin Visser and Maciej Zakarczemny, “Rectangle partitions generalizing integer partitions”, arXiv:2509.20495 (2025).

Progress summary

Never refreshed

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.