A minimum problem for finite sets of real numbers with nonnegative sum

DOI10.1155/2012/847958zbMATH Open1273.11045DBLPjournals/jam/ChiaselottiMN12arXiv1102.4761OpenAlexW2095631030WikidataQ58907473 ScholiaQ58907473MaRDI QIDQ443111FDOQ443111

Authors: Giuseppe Marino, C. Nardi, G. Chiaselotti 

Publication date: 6 August 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Abstract: Let $n$ and $r$ be two integers such that $0<rlen$; we denote by $gamma(n,r)$ [$eta(n,r)$] the minimum [maximum] number of the non-negative partial sums of a sum $su{m}_{1=1}^n{a}_{i}ge0$, where $a_1,cdots,a_n$ are $n$ real numbers arbitrarily chosen in such a way that $r$ of them are non-negative and the remaining $n-r$ 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:

oindent$(P1)$ {it which are the values of $gamma(n,r)$ and $eta(n,r)$ for each $n$ and $r$, $0<rlen$?} oindent$(P2)$ {it if $q$ is an integer such that $gamma(n,r)leqleeta(n,r)$, can we find $n$ real numbers $a_1,cdots,a_n$, such that $r$ of them are non-negative and the remaining $n-r$ are negative with $su{m}_{1=1}^n{a}_{i}ge0$, such that the number of the non-negative sums formed from these numbers is exactly $q$?}

oindent We prove that the solution of the problem $(P1)$ is given by $gamma(n,r)=2^{n-1}$ and $eta(n,r)=2^n-2^{n-r}$. We provide a partial result of the latter problem showing that the answer is affirmative for the weighted boolean maps. With respect to the problem $(P2)$ such maps (that we will introduce in the present paper) can be considered a generalization of the multisets $a_1,cdots,a_n$ with $su{m}_{1=1}^n{a}_{i}ge0$. More precisely we prove that for each $q$ such that $gamma(n,r)leqleeta(n,r)$ there exists a weighted boolean map having exactly $q$ positive boolean values.

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

Recommendations

• scientific article; zbMATH DE number 4198073
• On some numbers related to extremal combinatorial sum problems
• Solution of a problem on non-negative subset sums
• On the number of nonnegative sums
• On the number of nonnegative sums for certain function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75)

Cites Work

• Title not available (Why is that?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of lattices and Boolean functions related to the Manickam-Miklös-Singhi conjecture
• A method to count the positive 3-subsets in a set of real numbers with non-negative sum
• Title not available (Why is that?)
• On a conjecture of Manickam and Singhi
• The first distribution invariant of the Johnson-scheme
• On a problem concerning the weight functions
• New results related to a conjecture of Manickam and Singhi
• Title not available (Why is that?)

Cited In (9)

• Solution of a problem on non-negative subset sums
• Minmax problems for fractional parts of real numbers
• On some numbers related to extremal combinatorial sum problems
• A discrete dynamical model of signed partitions
• Parallel rank of two sandpile models of signed integer partitions
• Parallel and sequential dynamics of two discrete models of signed integer partitions
• The minimal sum of squares over partitions with a nonnegative rank
• Sand piles models of signed partitions with \(d\) piles
• Real subset sums and posets with an involution

This page was built for publication: A minimum problem for finite sets of real numbers with nonnegative sum

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