Hostname: page-component-848d4c4894-v5vhk Total loading time: 0 Render date: 2024-07-05T19:32:38.752Z Has data issue: false hasContentIssue false

Monochromatic Homothetic Copies of {1, 1 + s, 1 + s + t}

Published online by Cambridge University Press:  20 November 2018

Tom C. Brown
Affiliation:
Department of Mathematics and Statistics Simon Fraser University Burnaby, BC V5A 1S6, tbrown@sfu.ca
Bruce M. Landman
Affiliation:
Department of Mathematical Sciences University of North Carolina Greensboro, NC 27412, landman@steffi.uncg.edu
Marni Mishna
Affiliation:
Faculty of Mathematics University of Waterloo Waterloo, ON N2L 3G1, mjmishna@undergrad.math.uwaterloo.ca
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For positive integers s and t, let f(s, t) denote the smallest positive integer N such that every 2-colouring of [1, N] = {1, 2,...,N} has a monochromatic homothetic copy of {1, 1 + s, 1 + s + t}.

We show that f (s, t) = 4(s + t) + 1 whenever s/g and t/g are not congruent to 0 (modulo 4), where g = gcd(s, t). This can be viewed as a generalization of part of van der Waerden’s theorem on arithmetic progressions, since the 3-term arithmetic progressions are the homothetic copies of {1, 1 + 1, 1 + 1 + t}. We also show that f (s, t) = 4(s + t) + 1 in many other cases (for example, whenever s > 2t > 2 and t does not divide s), and that f (s, t) ≤ 4 (s + t) + 1 for all s, t.

Thus the set of homothetic copies of {1, 1 + s, 1 + s + t} is a set of triples with a particularly simple Ramsey function (at least for the case of two colours), and one wonders what other “natural” sets of triples, quadruples, etc., have simple (or easily estimated) Ramsey functions.

Keywords

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1997

References

1. Brown, T. C. and Erdʺos, P. and Freedman, A. R., Quasi-progressions and descending waves, J. Combin. Theory Ser. A 53 (1990), 8195.Google Scholar
2. Graham, R. L., Rothschild, B. L. and Spencer, J. H., Ramsey Theory, 2nd ed., John Wiley and Sons, New York, 1990.Google Scholar
3. Landman, Bruce M. and Greenwell, Raymond N., Values and bounds for Ramsey numbers associated with polynomial iteration, Discrete Math. 68 (1988), 7783.Google Scholar
4. Landman, Bruce M. and Greenwell, Raymond N., Some new bounds and values for van der Waerden-like numbers, Graphs Combin. 6 (1990), 287291.Google Scholar
5. van der Waerden, B. L., Beweis einer Baudetschen Vermutung, Nieuw Arch.Wisk. 15 (1927), 212216.Google Scholar