Let be the number of multisets of integer-sided rectangular blocks that tile an rectangle with sides parallel to the axes. A block may be rotated, and different arrangements of the same multiset count once. All logarithms are natural.
Theorem. For integers , put and . As , uniformly for all ,
This proves both growing-side assertions of Gajdzica and Zakarczemny’s Remark 5.9. Indeed , giving their lower and upper constants and , respectively. If , then and the lower bound is sharp. The theorem also identifies the leading logarithmic term at every intermediate aspect ratio. The two expressions for agree at . Original conjecture, Remark 5.9
Upper bound
Every feasible multiset has total area and its blocks have smaller side at most . First, dropping the restriction on the smaller side gives the multiset count of Lemma 5.1 of the original paper. That lemma gives
Second, overcount the block types by ordered pairs with and . For the logarithm of their multiset generating function evaluated at is at most
Thus . Minimizing gives , the explicit upper bound in the authors’ fixed-height paper. Taking the smaller of the two bounds and using proves the required upper bound uniformly. Lemma 5.1 · Theorem 1.1
A packing lower bound
Write for the ordinary integer partition function and set . For all sufficiently large at least partitions of have largest part at most (Gajdzica–Zakarczemny, Lemma 5.4). From these partitions delete all parts below . Each resulting partition has total at most , with every part satisfying . It has at most preimages, by recording the deleted multiplicities. Consequently there are at least choices. The threshold on is absolute. Lemma 5.4
For each integer in a range starting at , reserve strips of height and integer width , disjoint across all reservations. Let and set . Suppose . Pick a partition as above and turn each part into a block . Pack the blocks successively into the reserved strips, starting a new strip whenever the next block does not fit. Every abandoned strip contains width greater than , whereas the total width is at most . Thus the blocks fit, as in the authors’ Lemma 5.5. Use integer coordinates throughout and fill all unused cells of the board with unit squares.
This map into tile multisets is injective. Remove the unit squares and sort the remaining blocks by their smaller side. Since , the class with smaller side recovers exactly , including square blocks. Taking a logarithm gives
Two strip reservations
Put , , , and . Only sufficiently large is needed below. Define the upper endpoint , the range , and as follows.
If , take . Then and . Set
The strips can be stacked because . The argument of the floor is uniformly even at . Consequently
uniformly. Since and here,
If , take . Again , by the harmonic-sum estimate. Reserve side-by-side columns of integer widths across the board, placing strips inside each column, with
Indeed and . Both arguments of the floors grow uniformly: and . Hence (2) also holds here. In particular,
The first term is . For the second, decreases for once is large. Its value at is . Since and , the second term is . This bound also covers widths growing faster than any power of .
Summation
In both constructions, , with . Also in both cases. In particular . For sufficiently large , (2) gives for every . This lower bound tends to infinity uniformly. Moreover , so throughout the construction. The Hardy–Ramanujan formula and (2) give
The subtracted quantity in (1) is . For use and . For use and the decrease of on . Thus the loss is negligible uniformly, completing the proof.
Scope and prior work
The square theorem, the unrestricted multiset upper bound, the partition truncation estimate, and the shelf-packing observation are due to Gajdzica and Zakarczemny. Their later paper also uses separate columns for different smaller sides to prove the fixed-height formula. The contribution here is the uniform choice of the active smaller-side range and the two reservations. They attain the better of the two known upper bounds for every sequence of rectangles whose shorter side tends to infinity. The result is an asymptotic for the logarithm. Square case and conjecture · Fixed-height theorem
A November 18, 2026 search by author, statement, aspect ratio, and citing paper found no prior proof of the growing-side conjecture. The fixed-height theorem, Shaikh’s bounded-bar theorem and a subsequent two-row result concern other regimes. The proof above is unrefereed and historical priority remains unconfirmed. Restricted bars · Two-row result
The finite verifier enumerates small instances of the two strip constructions, checks disjointness cell by cell, and recovers each input family from its unordered tile multiset. The limiting estimates follow from the proof above.