Partition Theorems for Left and Right Variable Words

In 1984 T. Carlson and S. Simpson established an infinitary extension of the Hales–Jewett Theorem in which the leftmost letters of all but one of the words were required to be variables. (We call such words left variable words.) In this paper we extend the Carlson–Simpson result for left variable words, prove a corresponding result about right variable words, and determine precisely the extent to which left and right variable words can be combined in such extensions. The results mentioned so far all involve a finite alphabet. We show that the results for left variable words do not extend to words over an infinite alphabet, but that the results for right variable words do extend.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Neil Hindman1.

Additional information

1 This author acknowledges support received from the National Science Foundation via grant DMS-0070593.

2 This author acknowledges support received from the National Science Foundation via a post doctoral fellowship administered by the University of Maryland.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Hindman1, N., McCutcheon2, R. Partition Theorems for Left and Right Variable Words. Combinatorica 24, 271–286 (2004). https://doi.org/10.1007/s00493-004-0016-9

Download citation

Mathematics Subject Classification (2000):

  • 05D10
  • 22A15