On Certain Sets of Integers

1953/01/01 by K. F. Roth · 623 citations
Engineering · Mathematics · #Analytic Number Theory Research #Citation #Combinatorics #Computer science #Information retrieval #Library science #Mathematics #Mathematics and Applications #graph theory and CDMA systems

paper · doi:10.1112/jlms/s1-28.1.104

published in Journal of the London Mathematical Society s1-28(1), 104-109 (Wiley)

openalex publication_date 1953/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/25

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
• A Simple Regularization of Hypergraphs
• Fourier dimension and avoidance of linear patterns
• Difference sets and Polynomials of prime variables
• Arbitrarily Long Arithmetic Progressions of Primes on the Nose
• Comply subtraction games avoiding arithmetic progressions
• On solution-free sets for simultaneous diagonal polynomials
• Translation invariant quadratic forms and dense sets of primes
• A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-term Arithmetic Progressions
• Obstructions to uniformity, and arithmetic patterns in the primes
• Triangle-free Subgraphs of Hypergraphs
• Additive combinatorics with a view towards computer science and cryptography: An exposition
• Arithmetic progressions of primes in short intervals
• Base 3/2 and Greedily Partitioned Sequences
• Sets avoiding a rainbow solution to the generalized Schur equation
• Larger Corner-Free Sets from Better NOF Exactly-N Protocols
• Roth's theorem in the primes
• A Szemeredi-type regularity lemma in abelian groups, with applications
• Arithmetic progressions in multiplicative groups of finite fields
• Roth type theorems in finite groups
• Generalizations of Fourier analysis, and how to apply them
• Shape of the asymptotic maximum sum-free sets in integer lattice grids
• Erdős and Arithmetic Progressions
• Finding linear patterns of complexity one
• Long arithmetic progressions of primes
• The Brown-Erdős-Sós Conjecture for hypergraphs of large uniformity
• A variant of the hypergraph removal lemma
• Combinatorial theorems relative to sparse sets
• A near-optimal Quadratic Goldreich-Levin algorithm
• Valuations, arithmetic progressions, and prime numbers
• On the number of three-term arithmetic progressions in a dense subset of F_qⁿ
• A Density Increment Approach to Roth's Theorem in the Primes
• Difference sets and shifted primes
• On the growth of Stanley sequences
• On the combinatorial problems which I would most like to see solved
• Noise Correlation Bounds for Uniform Low Degree Functions
• On a two-dimensional analog of Szemeredi's Theorem in Abelian groups
• Bounds for graph regularity and removal lemmas
• Guest column
• Hilbert’s Fifth Problem and Related Topics
• Green's sumset problem at density one half
• Four variants of the Fourier-analytic transference principle
• Progression-free sets in Z₄ⁿ are exponentially small
• Finite field models in additive combinatorics
• Finite field models in arithmetic combinatorics – ten years on
• On the Complexity of Computing Prime Tables
• The primes contain arbitrarily long arithmetic progressions
• A new proof of Szemerédi's theorem
• On the stability of the Erdős–Ko–Rado theorem
• Klaus Friedrich Roth. 29 October 1925 — 10 November 2015
• A quantitative improvement for Roth's theorem on arithmetic progressions
• Bounds for graph regularity and removal lemmas
• The counting lemma for regulark‐uniform hypergraphs
• The Regularity Lemma and Its Applications in Graph Theory
• A variant of the hypergraph removal lemma
• Hypergraph regularity and the multidimensional Szemerédi theorem
• An improved construction of progression-free sets
• Obstructions to Uniformity and Arithmetic Patterns in the Primes
• On polynomial configurations in fractal sets
• New bounds for Szemeredi's theorem, II: A new bound for r₄(N)
• Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
• Structure in Sets with Logarithmic Doubling
• Klaus Roth [wikipedia]
• Szemerédi regularity lemma [wikipedia]
• Large subsets of Z m n without arithmetic progressions. [europepmc]