scientific article; zbMATH DE number 3169559
From MaRDI portal
Publication:3288185
Cited in
(26)- Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
- A note on multiparty communication complexity and the Hales-Jewett theorem
- On partitioning integers into progression free sets
- Roth's theorem in many variables
- On sets containing no geometric progression with integer ratio
- The number of k-dimensional corner-free subsets of grids
- Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\)
- Geometric progression-free sequences with small gaps
- Irregularities of sequences relative to arithmetic progressions. II
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A problem of Rankin on sets without geometric progressions
- Integer Sets Containing No Arithmetic Progressions
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- scientific article; zbMATH DE number 7556155 (Why is no real title available?)
- On sets of integers which contain no three terms in geometric progression
- A blurred view of Van der Waerden type theorems
- Sets without k‐term progressions can have many shorter progressions
- Avoiding 3-term geometric progressions in Hurwitz quaternions
- Arithmetic progressions at the journal of the LMS
- An improved protocol for ExactlyN with more than 3 players
- Subsets of \(\mathbb{F}_q[x]\) free of 3-term geometric progressions
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm
- Avoiding arithmetic progressions in cyclic groups
- Multiplicative structures in additively large sets
- Bounds on some van der Waerden numbers
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3288185)