Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on April 12, 2008
Bulletin of the London Mathematical Society 2008 40(2):210-216; doi:10.1112/blms/bdn027
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
40/2/210    most recent
bdn027v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Beiglböck, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

A variant of the Hales–Jewett theorem

Mathias Beiglböck

TU Vienna
Wiedner Hauptstrasse 8–10
1040 Vienna
Austria

Received 16 February 2005. Revision received 31 January 2008.

It was shown by Bergelson that any set B{subseteq} N with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: for each kisin N there exist a, b, disin N such that {b(a+id)j: i, jisin {1, 2, ..., k}}{subseteq}B. In particular, one cell of each finite partition of N contains such configurations. We prove a Hales–Jewett-type extension of this partition theorem.

The author thanks the Austrian Science Foundation FWF for its support through projects no. S8312 and no. S9612.

2000 Mathematics Subject Classification 05D10 (primary), 22A15 (secondary).


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.