On the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions
Canadian mathematical bulletin, Tome 42 (1999) no. 1, pp. 25-36

Voir la notice de l'article provenant de la source Cambridge University Press

Analogues of van der Waerden’s theorem on arithmetic progressions are considered where the family of all arithmetic progressions, $\text{AP}$ , is replaced by some subfamily of $\text{AP}$ . Specifically, we want to know for which sets $A$ , of positive integers, the following statement holds: for all positive integers $r$ and $k$ , there exists a positive integer $n={w}'\text{(}k,r)$ such that for every $r$ -coloring of $[1,\,n]$ there exists a monochromatic $k$ -term arithmetic progression whose common difference belongs to $A$ . We will call any subset of the positive integers that has the above property large. A set having this property for a specific fixed $r$ will be called $r$ -large. We give some necessary conditions for a set to be large, including the fact that every large set must contain an infinite number of multiples of each positive integer. Also, no large set $\{{{a}_{n}}\,:\,n\,=\,1,\,2,\ldots \}$ can have $\underset{n\to \infty }{\mathop{\lim \,\inf }}\,\,\frac{{{a}_{n+1}}}{{{a}_{n}}}\,>\,1$ . Sufficient conditions for a set to be large are also given. We show that any set containing $n$ -cubes for arbitrarily large $n$ , is a large set. Results involving the connection between the notions of “large” and “2-large” are given. Several open questions and a conjecture are presented.
DOI : 10.4153/CMB-1999-003-9
Mots-clés : 11B25, 05D10
Brown, Tom C.; Graham, Ronald L.; Landman, Bruce M. On the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions. Canadian mathematical bulletin, Tome 42 (1999) no. 1, pp. 25-36. doi: 10.4153/CMB-1999-003-9
@article{10_4153_CMB_1999_003_9,
     author = {Brown, Tom C. and Graham, Ronald L. and Landman, Bruce M.},
     title = {On the {Set} of {Common} {Differences} in van der {Waerden{\textquoteright}s} {Theorem} on {Arithmetic} {Progressions}},
     journal = {Canadian mathematical bulletin},
     pages = {25--36},
     year = {1999},
     volume = {42},
     number = {1},
     doi = {10.4153/CMB-1999-003-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-003-9/}
}
TY  - JOUR
AU  - Brown, Tom C.
AU  - Graham, Ronald L.
AU  - Landman, Bruce M.
TI  - On the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions
JO  - Canadian mathematical bulletin
PY  - 1999
SP  - 25
EP  - 36
VL  - 42
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-003-9/
DO  - 10.4153/CMB-1999-003-9
ID  - 10_4153_CMB_1999_003_9
ER  - 
%0 Journal Article
%A Brown, Tom C.
%A Graham, Ronald L.
%A Landman, Bruce M.
%T On the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions
%J Canadian mathematical bulletin
%D 1999
%P 25-36
%V 42
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-003-9/
%R 10.4153/CMB-1999-003-9
%F 10_4153_CMB_1999_003_9

[1] [1] Bergelson, V., Ergodic Ramsey theory—an update. In: Ergodic theory of Z-actions (Eds. Pollicott and Schmidt), LondonMath. Soc. Lecture Note Ser. 228 (1996), 1–61. Google Scholar

[2] [2] Bergelson, V. and Leibman, A., Polynomial extensions of van der Waerden's and Szemerédi's theorems. J. Amer. Math. Soc. 9 (1996), 725–753. Google Scholar

[3] [3] Brown, T. C., On van der Waerden's theorem and a theorem of Paris and Harrington. J. Combin. Theory Ser. A 30 (1981), 108–111. Google Scholar

[4] [4] Brown, T. C., Erdős, P. and Freedman, A. R., Quasi-progressions and descending waves. J. Combin. Theory Ser. A 53 (1990), 81–95. Google Scholar

[5] [5] Furstenberg, H., Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton University Press, Princeton, 1981. Google Scholar

[6] [6] Furstenberg, H., Poincaré Recurrence and Number Theory. Bull. American Math. Soc. 5 (1981), 211–234. Google Scholar

[7] [7] Furstenberg, H., A Polynomial Szemerédi Theorem. In: Combinatorics, Paul Erdős is Eighty, Janos Bolyai Mathematical Society, Budapest, 1996. Google Scholar

[8] [8] Greenwell, R. N. and Landman, B. M., On the existence of a reasonable upper bound for the van der Waerden numbers. J. Combin. Theory Ser. A 50 (1989), 82–86. Google Scholar

[9] [9] Hales, A. W. and Jewett, R. I., Regularity and positional games. Trans. Amer. Math. Soc. 106 (1963), 222–229. Google Scholar

[10] [10] Landman, B. M., Ramsey functions for quasi-progressions. Graphs and Combinatorics, to appear. Google Scholar

[11] [11] Landman, B. M., Avoiding arithmetic progressions (mod m) and arithmetic progressions. Utilitas Math., to appear. Google Scholar

[12] [12] Landman, B. M. and B. Wysocka, Collections of sequences having the Ramsey property only for few colors. Bull. Australian Math. Soc. 55 (1997), 19–28. Google Scholar

[13] [13] van der Waerden, B. L., Beweis einer Baudetschen Vermutung. Nieuw Arch.Wisk. 15 (1927), 212–216. Google Scholar

Cité par Sources :