On sets without \(k\)-term arithmetic progression

DOI10.1016/j.jcss.2011.09.003zbMath1237.68262OpenAlexW2044413646MaRDI QIDQ414926

Fei Deng, Meilian Liang, Xiaodong Xu, Zehui Shao

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.09.003

zbMATH Keywords

dynamic programmingarithmetic progressionsearch algorithmSzemerédi's theorem

Mathematics Subject Classification ID

Dynamic programming (90C39) Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic progressions (11B25)

Related Items (4)

On semi-progression van der Waerden numbers ⋮ Numerical semigroups of Szemerédi type ⋮ Novel structures in Stanley sequences ⋮ A generalization of sets without long arithmetic progressions based on Szekeres algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding large 3-free sets. I. The small \(n\) case
• Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n² ]
• On k-Free Sequences of Integers
• A new proof of Szemerédi's theorem

This page was built for publication: On sets without \(k\)-term arithmetic progression