Non-averaging Subsets and Non-vanishing Transversals

Noga Alon, I. Ruzsa

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

It is shown that every set ofnintegers contains a subset of sizeΩ(n1/6) in which no element is the average of two or more others. This improves a result of Abbott. It is also proved that for everyε>0 and everym>m(ε) the following holds. IfA1,...,Amaremsubsets of cardinality at leastm1+εeach, then there area1∈A1,...,am∈Amso that the sum of every nonempty subset of the set {a1,...,am} is nonzero. This is nearly tight. The proofs of both theorems are similar and combine simple probabilistic methods with combinatorial and number theoretic tools.

Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalJournal of Combinatorial Theory, Series A
Volume86
Issue number1
DOIs
Publication statusPublished - Apr 1999

Fingerprint

Transversals
Subset
Probabilistic Methods
Cardinality
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Non-averaging Subsets and Non-vanishing Transversals. / Alon, Noga; Ruzsa, I.

In: Journal of Combinatorial Theory, Series A, Vol. 86, No. 1, 04.1999, p. 1-13.

Research output: Contribution to journalArticle

@article{1f90fc8ce384401895ca8dc2bd3fbbc3,
title = "Non-averaging Subsets and Non-vanishing Transversals",
abstract = "It is shown that every set ofnintegers contains a subset of sizeΩ(n1/6) in which no element is the average of two or more others. This improves a result of Abbott. It is also proved that for everyε>0 and everym>m(ε) the following holds. IfA1,...,Amaremsubsets of cardinality at leastm1+εeach, then there area1∈A1,...,am∈Amso that the sum of every nonempty subset of the set {a1,...,am} is nonzero. This is nearly tight. The proofs of both theorems are similar and combine simple probabilistic methods with combinatorial and number theoretic tools.",
author = "Noga Alon and I. Ruzsa",
year = "1999",
month = "4",
doi = "10.1006/jcta.1998.2926",
language = "English",
volume = "86",
pages = "1--13",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Non-averaging Subsets and Non-vanishing Transversals

AU - Alon, Noga

AU - Ruzsa, I.

PY - 1999/4

Y1 - 1999/4

N2 - It is shown that every set ofnintegers contains a subset of sizeΩ(n1/6) in which no element is the average of two or more others. This improves a result of Abbott. It is also proved that for everyε>0 and everym>m(ε) the following holds. IfA1,...,Amaremsubsets of cardinality at leastm1+εeach, then there area1∈A1,...,am∈Amso that the sum of every nonempty subset of the set {a1,...,am} is nonzero. This is nearly tight. The proofs of both theorems are similar and combine simple probabilistic methods with combinatorial and number theoretic tools.

AB - It is shown that every set ofnintegers contains a subset of sizeΩ(n1/6) in which no element is the average of two or more others. This improves a result of Abbott. It is also proved that for everyε>0 and everym>m(ε) the following holds. IfA1,...,Amaremsubsets of cardinality at leastm1+εeach, then there area1∈A1,...,am∈Amso that the sum of every nonempty subset of the set {a1,...,am} is nonzero. This is nearly tight. The proofs of both theorems are similar and combine simple probabilistic methods with combinatorial and number theoretic tools.

UR - http://www.scopus.com/inward/record.url?scp=0009917149&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0009917149&partnerID=8YFLogxK

U2 - 10.1006/jcta.1998.2926

DO - 10.1006/jcta.1998.2926

M3 - Article

AN - SCOPUS:0009917149

VL - 86

SP - 1

EP - 13

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 1

ER -