科研之友
微信
新浪微博
Facebook
分享链接
摘要
In a recent paper 'A variant of the Hales-Jewett theorem', M. Beiglbock provides a version of the classic coloring result in which an instance of the variable in a word giving rise to a monochromatic combinatorial line can be moved around in a finite structure of specified type (for example, an arithmetic progression). We prove a density version of this result in which all instances of the variable may move. As an application, we obtain an elementary proof of a result of V. Bergelson stating that multiplicatively large subsets of N contain arbitrarily long geoarithmetic progressions.
- 出版日期2010-12
