The following pages link to On Roth's theorem on progressions (Q640798):
Displaying 50 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)
- A Roth-type theorem with mixed powers (Q780446) (← links)
- Novel structures in Stanley sequences (Q898128) (← links)
- Roth's theorem on progressions revisited (Q940788) (← links)
- Appendix to `Roth's theorem on progressions revisited' by J. Bourgain (Q940789) (← links)
- On Roth's theorem (Q1366665) (← links)
- Additive combinatorics and graph theory (Q1620873) (← 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)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← 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)
- On triples in arithmetic progression (Q1964140) (← links)
- Caps and progression-free sets in \(\mathbb{Z}_m^n\) (Q2004972) (← links)
- Roth's theorem in many variables (Q2017118) (← links)
- A subexponential upper bound for van der Waerden numbers \(W(3,k)\) (Q2030760) (← links)
- Improved bound in Roth's theorem on arithmetic progressions (Q2039550) (← links)
- The equidistant dimension of graphs (Q2147613) (← links)
- An improved lower bound related to the Furstenberg-Sárközy theorem (Q2256129) (← links)
- Nil Bohr\(_0\)-sets and polynomial recurrence (Q2257758) (← links)
- A short remark on the multiplicative energy of the spectrum (Q2314111) (← 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)
- Integer sets containing no arithmetic progressions (Q2640635) (← links)
- Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions (Q2657387) (← 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)
- On Extending Rohlin's Theorem to Sequences (Q3216849) (← links)
