Suresums

Joel Spencer

doi:10.1007/BF02579275

Suresums

Joel Spencer

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	203-208
Number of pages	6
Journal	Combinatorica
Volume	1
Issue number	2
DOIs	https://doi.org/10.1007/BF02579275
State	Published - Jun 1981

Keywords

AMS subject classification (1980): 05C15

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/BF02579275

Cite this

@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 = jun,

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

AN - SCOPUS:51249186360

SN - 0209-9683

VL - 1

SP - 203

EP - 208

JO - Combinatorica

JF - Combinatorica

IS - 2

ER -

Suresums

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this