An exponentially accurate cubic-partition approximation for two-row rectangle partitions
Let r(n) count multisets of integer-sided rectangular pieces that tile a 2 x n rectangle, with rotations allowed. Let a(N) be the cubic partition function, with generating function prod_{j>=1} (1-q^j)^{-1} (1-q^{2j})^{-1}. We show that, for every eps > 0, 0 <= a(2n) - a(2n-2) - r(n) = O_eps( exp( (2*pi/sqrt(3) + eps) * sqrt(n) ) ). Combining this estimate with a known Rademacher-type formula for cubic partitions gives an asymptotic expansion to every order. We obtain eventual strict log-concavity and eventual hyperbolicity of every fixed-degree Jensen polynomial of r(n). This establishes eventual log-concavity in a direction raised by Gajdzica, Visser and Zakarczemny. No explicit threshold for eventuality is claimed.
Authors
- Chandan Kumar Shukla
Publication Details
- Published
- 2026-11-14
- DOI
- https://doi.org/10.66977/xsci.2611.002b
- Primary Topic
- Advanced Mathematical Identities
- Type
- preprint