On Certain Sets of Integers

1953/01/01 by K. F. Roth · 56 citations
Mathematics · Engineering · #Mathematics and Applications #Analytic Number Theory Research #graph theory and CDMA systems

paper · doi:10.1112/jlms/s1-28.1.104

Cited by

• Compactness of abundance in asymmetric hypergraph removal lemmas
• Improvements on induced subgraphs of given sizes
• A probabilistic technique for finding almost-periods of convolutions
• On sums of subsets of Chen primes
• Hypergraph regularity and the multidimensional Szemerédi theorem
• The Hilton-Milner type results of (k, ℓ)-sum-free sets in \mathbb F_pⁿ
• On sets with small sumset in the circle
• Random sum-free subsets of Abelian groups
• New bounds for Szemerédi's theorem, III: A polylogarithmic bound for r₄(N)
• Combinatorial theorems relative to a random set
• On the classification of Stanley sequences
• On a Ramsey--Turán variant of Roth's theorem
• Probabilistic combinatorics at exponentially small scales
• Roth-type theorems in additive combinatroics
• An inverse theorem for the Gowers U³ norm
• Cycle Ramsey numbers for random graphs
• A Tight Bound for Hypergraph Regularity II
• Three Dimensional Corners: A Box Norm Proof
• On two-point configurations in random set
• A New Bound for the Brown--Erdős--Sós Problem
• Fourier duality in the Brascamp-Lieb inequality
• Tower-type bounds for Roth's theorem with popular differences
• Finite configurations in sparse sets
• The Lens of Abelian Embeddings
• The dichotomy between structure and randomness, arithmetic progressions, and the primes
• Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics
• Dense arrangements are locally very dense I
• Translation invariant quadratic forms in dense sets
• New fractal dimensions and some applications to arithmetic patches
• Roth's Theorem in Super Smooth Numbers
• The large k-term progression-free sets in ℤ_qⁿ
• A quantitative bound on Furstenberg-Sárközy patterns with shifted prime power common differences in primes
• On infinite sumsets and sets of multiple recurrence
• A new proof of the graph removal lemma
• Convergence of multiple ergodic averages
• A new proof of the density Hales-Jewett theorem
• Learning stabilizer structure of quantum states
• A quantitative ergodic theory proof of Szemerédi's theorem
• Proof of the Brown-Erdős-Sós conjecture in groups
• Finding arithmetic progressions in dense sets of integers
• Restriction theory of the Selberg sieve, with applications
• A non-linear Roth theorem for thick Cantor sets
• On Assouad dimension and arithmetic progressions in sets defined by digit restrictions
• The primes contain arbitrarily long arithmetic progressions
• The Story of Sunflowers
• Polynomial Property Testing
• Combinatorial theorems in sparse random sets
• Exploring the toolkit of Jean Bourgain
• On sets of integers not containing long arithmetic progressions
• The regularity method for graphs with few 4-cycles
• On the stability of the Erdős-Ko-Rado theorem
• Polynomials with Maximum Lead Coefficient Bounded on a Finite Set
• Finite field models in additive combinatorics
• Multiple recurrence and the structure of probability-preserving systems
• Quantum Algorithms for Gowers Norm Estimation, Polynomial Testing, and Arithmetic Progression Counting over Finite Abelian Groups
• Subset sums, completeness and colorings