On sets without k-term arithmetic progression
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5014484 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 2033289 (Why is no real title available?)
- A new proof of Szemerédi's theorem
- Finding large 3-free sets. I. The small \(n\) case
- On k-Free Sequences of Integers
- Small Sets which meet all the n -Term Arithmetic Progressions in the Interval [1, n2 ]
Cited in
(14)- Sets of \(k\)-recurrence but not \((k+1)\)-recurrence
- Unique sequences containing no k-term arithmetic progressions
- No iterated morphism generates any arshon sequence of odd order
- Sets without k‐term progressions can have many shorter progressions
- A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- scientific article; zbMATH DE number 7556155 (Why is no real title available?)
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm
- Novel structures in Stanley sequences
- On semi-progression van der Waerden numbers
- Numerical semigroups of Szemerédi type
- On sets containing no geometric progression with integer ratio
- Some new bounds and values for van der Waerden-like numbers
This page was built for publication: On sets without \(k\)-term arithmetic progression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414926)