The minimal sum of squares over partitions with a nonnegative rank

DOI10.1007/S00026-022-00625-ZzbMATH Open1526.05010arXiv2204.07873OpenAlexW4311297818MaRDI QIDQ6062817FDOQ6062817

Sela Fried

Publication date: 6 November 2023

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: Motivated by a question of Defant and Propp (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{)}_{ninmathbbN}$, we prove that $m_n=Thetaleft(n^{4/3}ight)$. Consequently, we improve by a factor of $2$ the lower bound provided by Defant and Propp for iterates of order two.

Full work available at URL: https://arxiv.org/abs/2204.07873

zbMATH Keywords

Bulgarian solitaire mapCarolina solitaire mapdegree of noninvertibility

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Cites Work

• Quantifying noninvertibility in discrete dynamical systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The minimal sum of squares over partitions with a nonnegative rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062817)