Asymptotics and inequalities for partitions into squares

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\mathrm{.}$ This solves a recent conjecture formulated by Bringmann and Mahlburg (2012).