Answers are grounded in this paper and cite their sources.
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 prodj>=1 (1-q^j)⁻¹ (1-q²ʲ)⁻¹. 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.
No takes yet. Share an insight, caveat, or question.
Chandan Kumar Shukla (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: