The following pages link to On Roth's theorem on progressions (Q640798):
Displayed 41 items.
- Ramsey-type numbers involving graphs and hypergraphs with large girth (Q324890) (← links)
- On the classification of Stanley sequences (Q326649) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs (Q331490) (← links)
- Van der Waerden function and colorings of hypergraphs with large girth (Q382207) (← links)
- Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset (Q415260) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Enumerating solution-free sets in the integers (Q509275) (← links)
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small (Q509698) (← links)
- Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
- Novel structures in Stanley sequences (Q898128) (← links)
- A new lower bound for van der Waerden numbers (Q1686261) (← links)
- Arithmetic progressions in multiplicative groups of finite fields (Q1686398) (← links)
- Maximal sets with no solution to \(x+y=3z\) (Q1701348) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- A generalization of Roth's theorem in function fields (Q1931928) (← links)
- Higher moments of convolutions (Q1937309) (← links)
- Roth's theorem in many variables (Q2017118) (← links)
- An improved lower bound related to the Furstenberg-Sárközy theorem (Q2256129) (← links)
- Nil Bohr\(_0\)-sets and polynomial recurrence (Q2257758) (← links)
- On the growth of Stanley sequences (Q2352057) (← links)
- Some remarks on barycentric-sum problems over cyclic groups (Q2509726) (← links)
- Finite field models in arithmetic combinatorics -- ten years on (Q2512891) (← links)
- ADDITIVE DIMENSION AND A THEOREM OF SANDERS (Q2788674) (← links)
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS (Q2794648) (← links)
- A Prime Analogue of Roth’s Theorem in Function Fields (Q2808220) (← links)
- ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING (Q2810742) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS (Q2849814) (← links)
- New bounds on cap sets (Q2879894) (← links)
- Some Properties of Lower Level-Sets of Convolutions (Q2908126) (← links)
- ON A DIAGONAL QUADRIC IN DENSE VARIABLES (Q2921061) (← links)
- On Systems of Complexity One in the Primes (Q2976356) (← links)
- Generalizations of Fourier analysis, and how to apply them (Q3178746) (← links)
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. (Q3188349) (← links)
- NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR (Q4604480) (← links)
- MATRIX PROGRESSIONS IN MULTIDIMENSIONAL SETS OF INTEGERS (Q5179250) (← links)
- ON IMPROVING ROTH'S THEOREM IN THE PRIMES (Q5179251) (← links)
- Covering the Large Spectrum and Generalized Riesz Products (Q5346540) (← links)
- An arithmetic transference proof of a relative Szemerédi theorem (Q5408700) (← links)
- On sets of integers which contain no three terms in geometric progression (Q5501150) (← links)