A remark on the problem of nonnegative k-subset sums

A remark on the problem of nonnegative k-subset sums Given a set of n real numbers with a nonnegative sum, consider the family of all its k-element subsets with nonnegative sums. How small can the size of this family be? We show that this problem is closely related to a problem raised by Ahlswede and Khachatrian in [1]. The latter, in a special case, is nothing else but the problem of determining a minimal number c n (k) such that any k-uniform hypergraph on n vertices having c n (k) + 1 edges has a perfect fractional matching. We show that results obtained in [1] can be applied for the former problem. Moreover, we conjecture that these problems have in general the same solution. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

A remark on the problem of nonnegative k-subset sums

, Volume 48 (4) – Jan 24, 2013
5 pages

/lp/springer_journal/a-remark-on-the-problem-of-nonnegative-k-subset-sums-tMuwrkwMNY
Publisher
Springer Journals
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S0032946012040059
Publisher site
See Article on Publisher Site

Abstract

Given a set of n real numbers with a nonnegative sum, consider the family of all its k-element subsets with nonnegative sums. How small can the size of this family be? We show that this problem is closely related to a problem raised by Ahlswede and Khachatrian in [1]. The latter, in a special case, is nothing else but the problem of determining a minimal number c n (k) such that any k-uniform hypergraph on n vertices having c n (k) + 1 edges has a perfect fractional matching. We show that results obtained in [1] can be applied for the former problem. Moreover, we conjecture that these problems have in general the same solution.

Journal

Problems of Information TransmissionSpringer Journals

Published: Jan 24, 2013

DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just \$49/month

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

DeepDyve

DeepDyve

Pro

Price

FREE

\$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations