A note on maximal progression-free sets |
| |
Authors: | Svetoslav Savchev Fang Chen |
| |
Institution: | Oxford College of Emory University, Oxford, GA 30054, USA |
| |
Abstract: | Erd?s et al Greedy algorithm, arithmetic progressions, subset sums and divisibility, Discrete Math. 200 (1999) 119-135.] asked whether there exists a maximal set of positive integers containing no three-term arithmetic progression and such that the difference of its adjacent elements approaches infinity. This note answers the question affirmatively by presenting such a set in which the difference of adjacent elements is strictly increasing. The construction generalizes to arithmetic progressions of any finite length. |
| |
Keywords: | Progression-free sets |
本文献已被 ScienceDirect 等数据库收录! |
|