6 research outputs found
Avoiding Monochromatic Sequences With Special Gaps
For a set of positive integers, and and fixed positive integers,
denote by the least positive integer (if it exists) such that
within every -coloring of there must be a monochromatic
sequence with for . We consider the existence of for various choices of , as
well as upper and lower bounds on this function. In particular, we show that
this function exists for all if is an odd translate of the set of
primes and .Comment: 16 page
Monochromatic paths for the integers
Recall that van der Waerden's theorem states that any finite coloring of the
naturals has arbitrarily long monochromatic arithmetic sequences. We explore
questions about the set of differences of those sequences
Progressions and Paths in Colorings of
A is a set such that any finite
coloring of contains arbitrarily long monochromatic progressions
with common difference in . Van der Waerden's theorem famously asserts that
itself is a ladder. We also discuss variants of ladders, namely
and sets, which are sets such
that any coloring of contains arbitrarily long (for accessible
sets) or infinite (for walkable sets) monochromatic sequences with consecutive
differences in . We show that sets with upper density 1 are ladders and
walkable. We also show that all directed graphs with infinite chromatic number
are accessible, and reduce the bound on the walkability order of sparse sets
from 3 to 2, making it tight.Comment: 7 page
New Bounds on van der Waerden-type Numbers for Generalized 3-term Arithmetic Progressions
Let a and b be positive integers with a \leq b. An (a,b)-triple is a set
{x,ax+d,bx+ 2d}, where x,d \geq 1. Define T(a,b;r) to be the least positive
integer n such that any r-coloring of {1,2...,n} contains a monochromatic
(a,b)-triple. Earlier results gave an upper bound on T(a,b;2) that is a fourth
degree polynomial in b and a, and a quadratic lower bound. A new upper bound
for T(a,b;2) is given that is a quadratic. Additionally, lower bounds are given
for the case in which a = b, updated tables are provided, and open questions
are presented.Comment: The newer version reflects an updated table of values of T(a,b
On Three Sets with Nondecreasing Diameter
Let denote the integers between and inclusive and, for a
finite subset , let the diameter of be equal to
. We write provided . For a
positive integer , let be the least integer such that any
-coloring has three monochromatic
-sets (not necessarily of the same color)
with and .
Improving upon upper and lower bounds of Bialostocki, Erd\H os and Lefmann, we
show that for ,
where if and otherwise.Comment: 24 page
Avoiding monochromatic sequences with special gaps, preprint
Abstract. For S β Z + and k and r fixed positive integers, denote by f(S, k; r) the least positive integer n (if it exists) such that within every r-coloring of {1, 2,..., n} there must be a monochromatic sequence {x1, x2,..., xk} with xi β xiβ1 β S for 2 β€ i β€ k. We consider the existence of f(S, k; r) for various choices of S, as well as upper and lower bounds on this function. In particular, we show that this function exists for all k if S is an odd translate of the set of primes and r = 2