The following pages link to (Q3613910):
Displaying 20 items.
- 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)
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm (Q740905) (← links)
- Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
- Bounds on some van der Waerden numbers (Q958741) (← links)
- A new proof of Szemerédi's theorem for arithmetic progressions of length four (Q1266182) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- An improved construction of progression-free sets (Q1758902) (← links)
- Simultaneous small fractional parts of polynomials (Q2035534) (← links)
- A uniform set with fewer than expected arithmetic progressions of length 4 (Q2220982) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries (Q3617276) (← links)
- NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR (Q4604480) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case (Q4645010) (← links)
- On the Ramsey number of the Brauer configuration (Q5112522) (← links)
- Partition regularity and multiplicatively syndetic sets (Q5146463) (← links)
- A purely combinatorial approach to simultaneous polynomial recurrence modulo 1 (Q5255232) (← links)
- On a problem of Gowers (Q5395524) (← links)
- Improved bounds for five-term arithmetic progressions (Q6659641) (← links)
