Skip to content

On nearly consecutive sequences without long arithmetic progressions

Jacob Fox, Carl Schildkraut

math.COarXiv:2608.20533

Abstract

A sequence a1,…,an of integers is nearly consecutive if ai+1-ai ∈ \1,2\ for 1 ≤ i ≤ n-1. We prove that there are nearly consecutive sequences of length Ω(2k/k2) that contain no k-term arithmetic progression. This improves on the previous best known bound of Alon and Zaks from 1998. We also prove a generalization for sequences with bounded gaps.

Create a lesson