AbstractNumbers similar to those of van der Waerden are examined. We consider increasing sequences of positive integers {x1, x2, …, xn} either that form an arithmetic sequence or for which there exists a polynomial f(x) = Σi = 0n − 2 aixi with ai ϵ Z, an − 2 > 0, and xj + 1 = f(xj). We denote by q(n) the least positive integer such that if {1, 2, …, q(n)} is 2-colored, then there exists a monochromatic sequence of the type just described. We give an upper bound for q(n), as well as values of q(n) for n ⩽ 5. A stronger upper bound for q(n) is conjectured and is shown to imply the existence of a similar bound on the nth van der Waerden number
AbstractFor each positive integer n, let the set of all 2-colorings of the interval [1, n]={1, 2, …,...
AbstractF. Cohen raised the following question: Determine or estimate a function F(d) so that if we ...
For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $...
AbstractRamsey functions similar to the van der Waerden numbers w(n) are studied. If A' is a class o...
AbstractNumbers similar to those of van der Waerden are examined. We consider increasing sequences o...
AbstractRamsey numbers similar to those of van der Waerden are examined. Rather than considering ari...
AbstractLet w(m,n) be the van der Waerden number in two colors. It is shown that w(m,n) is at least ...
AbstractFor integers b⩾0 and c⩾1, define fc(b) to be the least positive integer n such that for ever...
AbstractVan der Waerden's classical theorem on arithmetic progressions states that for any positive ...
abstract: Van der Waerden’s Theorem asserts that for any two positive integers k and r, one may find...
Extremal Combinatorics is one of the central and heavily contributed areas in discrete mathematics, ...
The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has...
AbstractA 2-coloring of the non-negative integers and a function h are given such that if P is any m...
AbstractFor positive integers n and k, let rk(n) be the size of the largest subset of {1,2,…,n} with...
AbstractDenote by B(k, l) the least integer such that, if the numbers 1, 2, 3,…, B(k, l) + 1 are par...
AbstractFor each positive integer n, let the set of all 2-colorings of the interval [1, n]={1, 2, …,...
AbstractF. Cohen raised the following question: Determine or estimate a function F(d) so that if we ...
For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $...
AbstractRamsey functions similar to the van der Waerden numbers w(n) are studied. If A' is a class o...
AbstractNumbers similar to those of van der Waerden are examined. We consider increasing sequences o...
AbstractRamsey numbers similar to those of van der Waerden are examined. Rather than considering ari...
AbstractLet w(m,n) be the van der Waerden number in two colors. It is shown that w(m,n) is at least ...
AbstractFor integers b⩾0 and c⩾1, define fc(b) to be the least positive integer n such that for ever...
AbstractVan der Waerden's classical theorem on arithmetic progressions states that for any positive ...
abstract: Van der Waerden’s Theorem asserts that for any two positive integers k and r, one may find...
Extremal Combinatorics is one of the central and heavily contributed areas in discrete mathematics, ...
The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has...
AbstractA 2-coloring of the non-negative integers and a function h are given such that if P is any m...
AbstractFor positive integers n and k, let rk(n) be the size of the largest subset of {1,2,…,n} with...
AbstractDenote by B(k, l) the least integer such that, if the numbers 1, 2, 3,…, B(k, l) + 1 are par...
AbstractFor each positive integer n, let the set of all 2-colorings of the interval [1, n]={1, 2, …,...
AbstractF. Cohen raised the following question: Determine or estimate a function F(d) so that if we ...
For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $...