Greedy algorithm, arithmetic progressions, subset sums and divisibility
From MaRDI portal
Publication:1301639
DOI10.1016/S0012-365X(98)00385-9zbMath0939.11006OpenAlexW2052034072WikidataQ105956388 ScholiaQ105956388MaRDI QIDQ1301639
Vsevolod F. Lev, Csaba Sándor, András Sárközy, Gerard Rauzy
Publication date: 2 July 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00385-9
Related Items (9)
On the classification of Stanley sequences ⋮ Novel structures in Stanley sequences ⋮ On the growth of the counting function of Stanley sequences ⋮ On \(\text{AP}_{3}\)-covering sequences ⋮ Characters of independent Stanley sequences ⋮ On generalized Stanley sequences ⋮ A note on maximal progression-free sets ⋮ A note on \(AP_3\)-covering sequences ⋮ On the growth of Stanley sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems on non-averaging and non-dividing sets
- Finite addition theorems. II
- On the lower estimation of non-averaging sets
- Integer sets containing no arithmetic progressions
- Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm
- Irregular Sets of Integers Generated by the Greedy Algorithm
- Integer Sets Containing No Arithmetic Progressions
- Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
- Sums of sets of group elements
- On a conjecture of Erdös and Heilbronn
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Primes in short intervals
This page was built for publication: Greedy algorithm, arithmetic progressions, subset sums and divisibility
