On the structure of sum-free sets, 2

Jean Marc Deshouillers; Gregory A. Freiman; Vera Sós; Mikhail Temkin

On the structure of sum-free sets, 2

Jean Marc Deshouillers^*, Gregory A. Freiman, Vera Sós, Mikhail Temkin

^*Corresponding author for this work

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

24 Scopus citations

Abstract

A finite set of positive integers is called sum-free if double-struck A∩n (double-struck A + double-struck A) is empty, where double-struck A + double-struck A denotes the set of sums of pairs of non necessarily distinct elements from double-struck A. Improving upon a previous result by G.A. Freiman, a precise description of the structure of sum-free sets included in [1, M] with cardinality larger than 0.4M - x for M ≥ M₀(x) (where x is an arbitrary given number) is given.

Original language	American English
Pages (from-to)	149-161
Number of pages	13
Journal	Asterisque
Volume	258
State	Published - 1999
Externally published	Yes

Keywords

Additive number theory
Arithmetic progressions
Combinatorial number theory
Sum-free sets

Cite this

@article{efe4b9c6f7c94d6185eb77271063f16e,

title = "On the structure of sum-free sets, 2",

abstract = "A finite set of positive integers is called sum-free if double-struck A∩n (double-struck A + double-struck A) is empty, where double-struck A + double-struck A denotes the set of sums of pairs of non necessarily distinct elements from double-struck A. Improving upon a previous result by G.A. Freiman, a precise description of the structure of sum-free sets included in [1, M] with cardinality larger than 0.4M - x for M ≥ M0(x) (where x is an arbitrary given number) is given.",

keywords = "Additive number theory, Arithmetic progressions, Combinatorial number theory, Sum-free sets",

author = "Deshouillers, {Jean Marc} and Freiman, {Gregory A.} and Vera S{\'o}s and Mikhail Temkin",

year = "1999",

language = "American English",

volume = "258",

pages = "149--161",

journal = "Asterisque",

issn = "0303-1179",

publisher = "Societe Mathematique de France",

}

TY - JOUR

T1 - On the structure of sum-free sets, 2

AU - Deshouillers, Jean Marc

AU - Freiman, Gregory A.

AU - Sós, Vera

AU - Temkin, Mikhail

PY - 1999

Y1 - 1999

N2 - A finite set of positive integers is called sum-free if double-struck A∩n (double-struck A + double-struck A) is empty, where double-struck A + double-struck A denotes the set of sums of pairs of non necessarily distinct elements from double-struck A. Improving upon a previous result by G.A. Freiman, a precise description of the structure of sum-free sets included in [1, M] with cardinality larger than 0.4M - x for M ≥ M0(x) (where x is an arbitrary given number) is given.

AB - A finite set of positive integers is called sum-free if double-struck A∩n (double-struck A + double-struck A) is empty, where double-struck A + double-struck A denotes the set of sums of pairs of non necessarily distinct elements from double-struck A. Improving upon a previous result by G.A. Freiman, a precise description of the structure of sum-free sets included in [1, M] with cardinality larger than 0.4M - x for M ≥ M0(x) (where x is an arbitrary given number) is given.

KW - Additive number theory

KW - Arithmetic progressions

KW - Combinatorial number theory

KW - Sum-free sets

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

M3 - Article

AN - SCOPUS:0001171386

SN - 0303-1179

VL - 258

SP - 149

EP - 161

JO - Asterisque

JF - Asterisque

ER -

On the structure of sum-free sets, 2

Abstract

Keywords

Other files and links

Fingerprint

Cite this