Asymptotics and inequalities for partitions into squares

Abstract

In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for n large enough, the two quantities are different and which of the two is bigger depends on the parity of n. This solves a recent conjecture formulated by Bringmann and Mahlburg (2012).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…