A Minimum problem for finite sets of real numbers with non-negative sum
Giampiero Chiaselotti, Giuseppe Marino, Caterina Nardi

TL;DR
This paper determines the minimum and maximum number of non-negative partial sums for real number sets with fixed positive and negative counts, and explores the existence of specific sum counts within these bounds.
Contribution
It explicitly calculates the extremal values of non-negative partial sums and introduces weighted boolean maps to address sum count realizability.
Findings
Abstract
Let and be two integers such that ; we denote by [] the minimum [maximum] number of the non-negative partial sums of a sum , where are real numbers arbitrarily chosen in such a way that of them are non-negative and the remaining are negative. Inspired by some interesting extremal combinatorial sum problems raised by Manickam, Mikl\"os and Singhi in 1987 \cite{ManMik87} and 1988 \cite{ManSin88} we study the following two problems: \noindent {\it which are the values of and for each and , ?} \noindent {\it if is an integer such that , can we find real numbers , such that of them are non-negative and the remaining are negative with ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Dynamics and Fractals · Analytic Number Theory Research
