The Minimal Sum of Squares Over Partitions with a Nonnegative Rank

Motivated by a question of Defant and Propp (Electron J Combin 27:Article P3.51, 2020) regarding the connection between the degrees of noninvertibility of functions and those of their iterates, we address the combinatorial optimization problem of minimizing the sum of squares over partitions of n with a nonnegative rank. Denoting the sequence of the minima by ( m n ) n ∈ N , we prove that m n = Θ n 4 / 3 . Consequently, we improve by a factor of 2 the lower bound provided by Defant and Propp for iterates of order two.