ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p(m,n)p(m,n) be the number of partitions of an m×nm\times n rectangle into integer-sided rectangular blocks, where partitions are identified when they consist of the same multiset of blocks, regardless of geometric arrangement. For every fixed positive integer mm, as n→∞n\to\infty, one conjectures that log⁡p(m,n)=π2mHm3n+O(log⁡n)\log p(m,n)=\pi\sqrt{\frac{2mH_m}{3}}\sqrt{n}+O(\log n), where Hm=∑k=1m1kH_m=\sum_{k=1}^{m}\frac{1}{k} is the mm-th harmonic number.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.