A generalization of sets without long arithmetic progressions based on Szekeres algorithm
From MaRDI portal
Publication:740905
Recommendations
- On sets without k-term arithmetic progression
- Unique sequences containing no k-term arithmetic progressions
- Sets of integers that do not contain long arithmetic progressions
- Sets without k‐term progressions can have many shorter progressions
- Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions
Cites work
- scientific article; zbMATH DE number 3169559 (Why is no real title available?)
- scientific article; zbMATH DE number 5528961 (Why is no real title available?)
- scientific article; zbMATH DE number 3059689 (Why is no real title available?)
- A new method to construct lower bounds for van der Waerden numbers
- A new proof of Szemerédi's theorem
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On k-Free Sequences of Integers
- On sets without \(k\)-term arithmetic progression
- On the combinatorial problems which I would most like to see solved
- Roth's theorem on progressions revisited
- Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm
- Sets of integers that do not contain long arithmetic progressions
- Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n2 ]
- Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
- Some Progression-Free Partitions Constructed using Folkman's Method
- The Sum of the Reciprocals of a Set of Integers with no Arithmetic Progression of k Terms
- The primes contain arbitrarily long arithmetic progressions
Cited in
(2)
This page was built for publication: A generalization of sets without long arithmetic progressions based on Szekeres algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740905)
