scientific article; zbMATH DE number 3523693

Cited in

(56)

Sumsets contained in infinite sets of integers
On infinite sum-free sets of natural numbers
Algebraic conditions for additive functions over the reals and over finite fields
Arithmetic progressions in multiplicative groups of finite fields
A removal lemma for systems of linear equations over finite fields
A note on multiparty communication complexity and the Hales-Jewett theorem
Bounds for graph regularity and removal lemmas
Noise correlation bounds for uniform low degree functions
On Assouad dimension and arithmetic progressions in sets defined by digit restrictions
On sets containing no geometric progression with integer ratio
Posterior contraction rates for stochastic block models
A weighted regularity lemma with applications
A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
A Hardy field extension of Szemerédi's theorem
Remarks on a Ramsey theory for trees
The Gaussian primes contain arbitrarily shaped constellations
On sums and products of combinatorial cubes
Monochromatic sums and products
A new problem on integer sets without 3AP
Ramsey properties of random discrete structures
The quasi-randomness of hypergraph cut properties
Small gaps between prime numbers: The work of Goldston-Pintz-Yildirim
Combinatorial theorems in sparse random sets
Integer Sets Containing No Arithmetic Progressions
Regularity lemmas for hypergraphs and quasi-randomness
On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
Nearly equal distances in metric spaces
Regularity properties for triple systems
Extremal problems on set systems
New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
Counting subgraphs in quasi‐random 4‐uniform hypergraphs
Regularity Lemma for k-uniform hypergraphs
Green's conjecture and testing linear invariant properties
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
Random differences in Szemerédi's theorem and related results
The poset of hypergraph quasirandomness
On points with positive density of the digit sequence in infinite iterated function systems
On regularity lemmas and their algorithmic applications
Stability results for random discrete structures
On sets of integers containing no four elements in arithmetic progression
A large gap in a dilate of a set
Turán‐ and Ramsey‐type results for unavoidable subgraphs
Sets without k‐term progressions can have many shorter progressions
Multidimensional multiplicative large sets in totally minimal systems
Turán‐type problems for long cycles in random and pseudo‐random graphs
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
Multiple recurrence and convergence for Hardy sequences of polynomial growth
Questions in linear recurrence. II: Lineability properties
Questions in linear recurrence. I: The T T-recurrence problem
Arithmetic progressions, different regularity lemmas and removal lemmas
Sub-Ramsey numbers for arithmetic progressions
A variant of the hypergraph removal lemma
Subspaces and orthogonal decompositions generated by bounded orthogonal systems
Multiple recurrence and convergence results associated to F_P^-actions
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 Q4101924)