A generalization of sets without long arithmetic progressions based on Szekeres algorithm

DOI10.1016/j.jnt.2013.05.008zbMath1364.11019OpenAlexW2091570833MaRDI QIDQ740905

Xiaodong Xu

Publication date: 9 September 2014

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2013.05.008

zbMATH Keywords

arithmetic progressionsSzemerédi's theoremvan der Waerden numbers

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Arithmetic progressions (11B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sets without \(k\)-term arithmetic progression
• Sets of integers that do not contain long arithmetic progressions
• A new method to construct lower bounds for van der Waerden numbers
• Roth's theorem on progressions revisited
• Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
• On the combinatorial problems which I would most like to see solved
• The primes contain arbitrarily long arithmetic progressions
• Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm
• Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n² ]
• The Sum of the Reciprocals of a Set of Integers with no Arithmetic Progression of k Terms
• Some Progression-Free Partitions Constructed using Folkman's Method
• On k-Free Sequences of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• A new proof of Szemerédi's theorem

This page was built for publication: A generalization of sets without long arithmetic progressions based on Szekeres algorithm