Suresums

Research output: Contribution to journalArticle

Abstract

A suresum is a pair (A, n), A ⊂ {1, ..., n-1}, so that whenever A is 2-colored some monochromatic set sums to n. A "finite basis" for the suresum (A, n) with |A| ≦c is proven to exist. For c fixed, it is shown that no suresum (A, n) exist if n is a sufficiently large prime. Generalizations to r-colorations, r>2, are discussed.

Original languageEnglish (US)
Pages (from-to)203-208
Number of pages6
JournalCombinatorica
Volume1
Issue number2
DOIs
StatePublished - Jun 1981

Fingerprint

Sumsets
Generalization

Keywords

  • AMS subject classification (1980): 05C15

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

Suresums. / Spencer, Joel.

In: Combinatorica, Vol. 1, No. 2, 06.1981, p. 203-208.

Research output: Contribution to journalArticle

Spencer, Joel. / Suresums. In: Combinatorica. 1981 ; Vol. 1, No. 2. pp. 203-208.
@article{e52299bf961b4b8aa5c7ce9454adb1a7,
title = "Suresums",
abstract = "A suresum is a pair (A, n), A ⊂ {1, ..., n-1}, so that whenever A is 2-colored some monochromatic set sums to n. A {"}finite basis{"} for the suresum (A, n) with |A| ≦c is proven to exist. For c fixed, it is shown that no suresum (A, n) exist if n is a sufficiently large prime. Generalizations to r-colorations, r>2, are discussed.",
keywords = "AMS subject classification (1980): 05C15",
author = "Joel Spencer",
year = "1981",
month = "6",
doi = "10.1007/BF02579275",
language = "English (US)",
volume = "1",
pages = "203--208",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "2",

}

TY - JOUR

T1 - Suresums

AU - Spencer, Joel

PY - 1981/6

Y1 - 1981/6

N2 - A suresum is a pair (A, n), A ⊂ {1, ..., n-1}, so that whenever A is 2-colored some monochromatic set sums to n. A "finite basis" for the suresum (A, n) with |A| ≦c is proven to exist. For c fixed, it is shown that no suresum (A, n) exist if n is a sufficiently large prime. Generalizations to r-colorations, r>2, are discussed.

AB - A suresum is a pair (A, n), A ⊂ {1, ..., n-1}, so that whenever A is 2-colored some monochromatic set sums to n. A "finite basis" for the suresum (A, n) with |A| ≦c is proven to exist. For c fixed, it is shown that no suresum (A, n) exist if n is a sufficiently large prime. Generalizations to r-colorations, r>2, are discussed.

KW - AMS subject classification (1980): 05C15

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

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

U2 - 10.1007/BF02579275

DO - 10.1007/BF02579275

M3 - Article

VL - 1

SP - 203

EP - 208

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 2

ER -