Progressions in sequences of nearly consecutive integers
From MaRDI portal
For \(k\geq 3\) and \(r\geq 2\), let \(G(r,k)\) denote the smallest positive integer \(m\) such that every sequence of integers \(a_1, \cdots , a_m\) such that \(1\leq a_{j+1}-a_j\leq r\), \(1\leq j\leq m-1\), contains a \(k\)-term arithmetic progression. The authors show that for every fixed \(r\geq 2\), there is a constant \(c_r\), such that \(G(k,r)>r^{k-c_r\sqrt{k}}\), for all \(k\).
Recommendations
Cites work
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- Arithmetic Progressions Contained in Sequences with Bounded Gaps
- Arithmetic progressions in sequences with bounded gaps
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- Legitimate colorings of projective planes
- On Applications of Van Der Waerden's Theorem
- Primitive Recursive Bounds for Van Der Waerden Numbers
Cited in
(7)- Integer sequences with proscribed differences and bounded growth rate
- A pseudo upper bound for the van der Waerden function
- Counting pseudo progressions
- Arithmetic progressions in the graphs of slightly curved sequences
- scientific article; zbMATH DE number 5528974 (Why is no real title available?)
- Consecutive Integers with Close Kernels
- On near relative prime number in a sequence of positive integers
This page was built for publication: Progressions in sequences of nearly consecutive integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268731)
