Abstract
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\in {\mathbb {N}}}\), we prove that \(m_n=\Theta \left( n^{4/3}\right) \). Consequently, we improve by a factor of 2 the lower bound provided by Defant and Propp for iterates of order two.
Similar content being viewed by others
Data Availability
Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.
References
G. E. Andrews, The Theory of Partitions, Cambridge Univ. Press, 1984.
C. Defant and J. Propp, Quantifying noninvertibility in discrete dynamical systems, Electron. J. Combin. 27 (2020), Article P3.51.
F. J. Dyson, Some guesses in the theory of partitions, Eureka (Cambridge) 8 (1944), 10–15.
N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, OEIS Foundation Inc., https://oeis.org.
E. B. Vinberg, A Course in Algebra, Amer. Math. Soc. Press, 2003.
Acknowledgements
We thank the anonymous referees for their careful reading of the manuscript and for their suggestions that helped us improve this work significantly. In particular, the proof of Lemma 3.9 was shown to us by the second referee as a simpler alternative to our original proof.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
We state that there is no conflict of interest.
Additional information
Communicated by Sylvie Corteel.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Sela Fried is a postdoctoral fellow in the Department of Computer Science at the Ben-Gurion University of the Negev and a teaching fellow in the Department of Computer Science at the Israel Academic College in Ramat Gan
Appendix
Appendix
Denote \(z_n=\left\lfloor x_0^{(n)}\right\rfloor \) and \(X_i=\frac{1}{(z_n-1)^i}\), for \(i=1,2,3\). We have
Recall that \(\lim _{n\rightarrow \infty } \frac{z_n}{n^{2/3}} = 2^{-1/3}\) (this was stated in the proof of Theorem 2.3). Thus, the expansion of \(\frac{p_n^3}{27}+\frac{q_n^2}{4}\) contains terms of order \(n^4\) (the boxed terms). Nevertheless, the overall order is \(<n^4\), as the following calculation shows:
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Fried, S. The Minimal Sum of Squares Over Partitions with a Nonnegative Rank. Ann. Comb. 27, 781–797 (2023). https://doi.org/10.1007/s00026-022-00625-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-022-00625-z