AbstractFork>2 andr⩾2, letG(k,r) denote the smallest positive integergsuch that every increasing sequence ofgintegers {a1,a2,…,ag} with gapsaj+1−aj∈{1,…,emsp14;r}, 1⩽j⩽g−1 contains ak-term arithmetic progression. Brown and Hare proved thatG(k,2)>(k−1)/2(34)(k−1)/2and thatG(k,2s−1)>(sk−2/ek)(1+o(1)) for alls⩾2. Here we improve these bounds and prove thatG(k,2)>2k−O(k)and, more generally, that for every fixedr⩾2 there exists a constantcr>0 such thatG(k,r)>rk−crkfor allk
Abstract. Sharpening (a particular case of) a result of Szemerédi and Vu [4] and extending earlier ...
AbstractF. Cohen raised the following question: Determine or estimate a function F(d) so that if we ...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
AbstractFork>2 andr⩾2, letG(k,r) denote the smallest positive integergsuch that every increasing seq...
AbstractLetG(k, r) denote the smallest positive integergsuch that if 1=a1, a2, …, agis a strictly in...
Let f_(s, k)(n) be the maximum possible number of s‐term arithmetic progressions in a set of n integ...
Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutiv...
AbstractLetG(X) denote the largest gap between consecutive primes belowX. Improving earlier results ...
In this paper I make the following conjecture: for any arithmetic progression a + b*k, where at leas...
AbstractLet N+(k)=2k/2k3/2f(k) and N−(k)=2k/2k1/2g(k) where f(k)→∞ and g(k)→0 arbitrarily slowly as ...
AbstractLet G(x;q,a):=maxPn⩽x(Pn+1−Pn),Pn‵Pn+1‵amodq where (a, q) = 1 and Pn, Pn + 1 are consecutive...
Let \mathbb{N} denote the set of all nonnegative integers. Let k \ge 3 be an integer and A_0 = {a_1,...
AbstractLetg(n)⩾0 be a function. A sequence ofkpositive integers,a1<a2<…<ak, is called ak-term semi-...
AbstractWe consider a number of density problems for integer sequences with certain divisibility pro...
AbstractIt is conjectured that an integer sequence containing no k consecutive terms of any arithmet...
Abstract. Sharpening (a particular case of) a result of Szemerédi and Vu [4] and extending earlier ...
AbstractF. Cohen raised the following question: Determine or estimate a function F(d) so that if we ...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
AbstractFork>2 andr⩾2, letG(k,r) denote the smallest positive integergsuch that every increasing seq...
AbstractLetG(k, r) denote the smallest positive integergsuch that if 1=a1, a2, …, agis a strictly in...
Let f_(s, k)(n) be the maximum possible number of s‐term arithmetic progressions in a set of n integ...
Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutiv...
AbstractLetG(X) denote the largest gap between consecutive primes belowX. Improving earlier results ...
In this paper I make the following conjecture: for any arithmetic progression a + b*k, where at leas...
AbstractLet N+(k)=2k/2k3/2f(k) and N−(k)=2k/2k1/2g(k) where f(k)→∞ and g(k)→0 arbitrarily slowly as ...
AbstractLet G(x;q,a):=maxPn⩽x(Pn+1−Pn),Pn‵Pn+1‵amodq where (a, q) = 1 and Pn, Pn + 1 are consecutive...
Let \mathbb{N} denote the set of all nonnegative integers. Let k \ge 3 be an integer and A_0 = {a_1,...
AbstractLetg(n)⩾0 be a function. A sequence ofkpositive integers,a1<a2<…<ak, is called ak-term semi-...
AbstractWe consider a number of density problems for integer sequences with certain divisibility pro...
AbstractIt is conjectured that an integer sequence containing no k consecutive terms of any arithmet...
Abstract. Sharpening (a particular case of) a result of Szemerédi and Vu [4] and extending earlier ...
AbstractF. Cohen raised the following question: Determine or estimate a function F(d) so that if we ...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...