Integer Sets Containing No Arithmetic Progressions
From MaRDI portal
Recommendations
- Integer sets containing no arithmetic progressions
- Sets of integers that do not contain long arithmetic progressions
- On sets of integers containing k elements in arithmetic progression
- scientific article; zbMATH DE number 3523693
- On sequences of integers containing no arithmetic progression
- Sets of nonnegative integers not containing an arithmetic progression of length đ
- On sets of integers containing no four elements in arithmetic progression
- scientific article; zbMATH DE number 3169559
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Cited in
(75)- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression
- Subset sums
- Arithmetical progressions and the number of sums
- Greedy algorithm, arithmetic progressions, subset sums and divisibility
- Progression-free sets in finite abelian groups.
- Additive combinatorics and graph theory
- Threshold functions and Poisson convergence for systems of equations in random sets
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- A generalization of Roth's theorem in function fields
- ErdĆs and the integers
- On triples in arithmetic progression
- Roth's theorem in many variables
- Improved bound in Roth's theorem on arithmetic progressions
- On sets containing no geometric progression with integer ratio
- A Szemerédi-type theorem for subsets of the unit cube
- The equidistant dimension of graphs
- Analytic number theory. Abstracts from the workshop held November 3--9, 2019
- Integer sets containing no arithmetic progressions
- Roth's theorem for four variables and additive structures in sums of sparse sets
- A prime analogue of Roth's theorem in function fields
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- On a diagonal quadric in dense variables
- Generalizations of Fourier analysis, and how to apply them
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- An extension of Behrend's theorem
- On certain other sets of integers
- A new proof of Rothâs theorem on arithmetic progressions
- Uniform hypergraphs containing no grids
- On sets of integers containing k elements in arithmetic progression
- Six Primes and an Almost Prime in Four Linear Equations
- A proof of two Erdös conjectures on restricted addition and further results
- On non-intersecting arithmetic progressions
- New applications of the polynomial method: the cap set conjecture and beyond
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- Szemerédi's Theorem in the Primes
- scientific article; zbMATH DE number 7556155 (Why is no real title available?)
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Matrix progressions in multidimensional sets of integers
- On improving Roth's theorem in the primes
- Logarithmic bounds for Roth's theorem via almost-periodicity
- Finding linear patterns of complexity one
- On a problem of Gowers
- scientific article; zbMATH DE number 5219601 (Why is no real title available?)
- On sets of integers which contain no three terms in geometric progression
- From harmonic analysis to arithmetic combinatorics
- On sets of integers containing no four elements in arithmetic progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Tower-type bounds for Roth's theorem with popular differences
- Integer sequences without singleton intersection
- Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes
- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II
- scientific article; zbMATH DE number 7733110 (Why is no real title available?)
- Norm estimates for the Kakeya maximal function in high dimensions with respect to general measures
- Roth-type theorem for quadratic system in Piatetski-Shapiro primes
- On Roth's theorem on progressions
- Quantitative bounds in the nonlinear Roth theorem
- Improved bounds for five-term arithmetic progressions
- Arithmetic progressions at the journal of the LMS
- Perfect proper edge colorings of regular bipartite graphs with rainbow \(C_4\)-\(\mathrm{s}\)
- Improved bounds for skew corner-free sets
- Roth-type theorem for nonlinear equations in Piatetski-Shapiro primes
- On the size of sets avoiding a general structure
- An upper bound for the k-barycentric Davenport constant of groups of prime order
- Pairing-based batch arguments for NP with a linear-size CRS
- Roth-type theorem with unequal powers of Piatetski-Shapiro primes
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Roth's theorem in the Piatetski-Shapiro primes
- A Roth-type theorem with mixed powers
- Injective colorings with arithmetic constraints
- Novel structures in Stanley sequences
- Finding large 3-free sets. I. The small \(n\) case
- Roth's theorem on progressions revisited
- On distinct distances and \(\lambda \)-free point sets
- Polynomial configurations in difference sets
This page was built for publication: Integer Sets Containing No Arithmetic Progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3717154)