On nearly consecutive sequences without long arithmetic progressions
Jacob Fox, Carl Schildkraut
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
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato