On sets of integers containing no four elements in arithmetic progression

Recommendations

scientific article; zbMATH DE number 3342086
On sets of integers containing k elements in arithmetic progression
scientific article; zbMATH DE number 3523693
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
scientific article; zbMATH DE number 3297285
Integer sets containing no arithmetic progressions
Integer Sets Containing No Arithmetic Progressions
On Sequences of Integers with No 4, or No 5 Numbers in Arithmetical Progression
On sequences of integers containing no arithmetic progression

Cited in

(60)

A density version of a geometric Ramsey theorem
Behrend's theorem for sequences containing no k-element arithmetic progression of a certain type
Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
Additive combinatorics and graph theory
Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
On partitioning integers into progression free sets
Number theory -- probabilistic, heuristic, and computational approaches
Hilbert cubes in progression-free sets and in the set of squares
On sequences containing at most 4 pairwise coprime integers
On Assouad dimension and arithmetic progressions in sets defined by digit restrictions
A new bound for the Brown-Erdős-Sós problem
Fourier dimension and avoidance of linear patterns
A Furstenberg-Zimmer structure theorem for -finite measure spaces
A Szemerédi-type theorem for subsets of the unit cube
The polynomial Carleson operator
Discrete quantum subgroup asymptotically fixing a sequence of finite subsets
Szemerédi's proof of Szemerédi's theorem
Arithmetic progressions in self-similar sets
The Gaussian primes contain arbitrarily shaped constellations
Irregularities of sequences relative to arithmetic progressions. IV
An upper bound for Hilbert cubes
Popular differences for right isosceles triangles
Box-counting dimensions of popcorn subsets
Additive combinatorics: with a view towards computer science and cryptography -- an exposition
Gowers uniformity norm and pseudorandom measures of the pseudorandom binary sequences
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Tilted corners in integer grids
Integer Sets Containing No Arithmetic Progressions
On sets of integers not containing arithmetic progressions of prescribed length
Linear problems in combinatorial number theory
On the number of squares in an arithmetic progression
New applications of the polynomial method: the cap set conjecture and beyond
Hilbert’s Proof of His Irreducibility Theorem
New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
scientific article; zbMATH DE number 6957250 (Why is no real title available?)
On a problem of P. Erdős
Boolean algebras and Lubell functions
The structure theory of set addition revisited
A Ramsey variant of the Brown-Erdős-Sós conjecture
A general nonlinear version of Roth's theorem on the real line
Approximation by special values of Dirichlet series
Growth in groups: ideas and perspectives
What is good mathematics?
From harmonic analysis to arithmetic combinatorics
The Green-Tao Theorem and the Infinitude of Primes in Domains
Graph norms and Sidorenko's conjecture
On some properties of sparse sets: a survey
Arithmetic progressions in certain subsets of finite fields
An exploration of very triangular numbers
Local-vs-global combinatorics
Arithmetic progressions at the journal of the LMS
Some new results on the higher energies
Energy bounds for modular roots and their applications
Comparing computational entropies below majority (or: when is the dense model theorem false?)
On the polynomial Szemerédi theorem in finite commutative rings
Arithmetic progressions, different regularity lemmas and removal lemmas
Trigonometric series with gaps
Multiplicatively large sets and ergodic Ramsey theory
A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
Finding large 3-free sets. I. The small \(n\) case

This page was built for publication: On sets of integers containing no four elements in arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563457)