The following pages link to New bounds on cap sets (Q2879894):
Displaying 37 items.
- On sunflowers and matrix multiplication (Q354642) (← links)
- Growth polynomials for additive quadruples and \((h,k)\)-tuples (Q396993) (← links)
- Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory (Q491979) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small (Q509698) (← links)
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression (Q509700) (← links)
- A new construction of caps (Q712229) (← links)
- Energies and structure of additive sets (Q743659) (← links)
- The cap set problem and standard diagrams (Q1981684) (← links)
- Caps and progression-free sets in \(\mathbb{Z}_m^n\) (Q2004972) (← 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)
- Bounds on the size of progression-free sets in \(\mathbb{Z}_m^n\) (Q2146238) (← links)
- The \(G\)-stable rank for tensors and the cap set problem (Q2166199) (← links)
- Improved bounds for progression-free sets in \(C_8^n\) (Q2182029) (← links)
- On the missing log in upper tail estimates (Q2284727) (← links)
- Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method (Q2326330) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← 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)
- 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)
- Some properties of lower level-sets of convolutions (Q2908126) (← links)
- Some new results on higher energies (Q2930850) (← links)
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. (Q3188349) (← links)
- \textsc{Superset}: A (super)natural variant of the card game \textsc{Set} (Q3305730) (← links)
- Bounds on affine caps (Q4534381) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- A new upper bound for sets with no square differences (Q5041007) (← links)
- Logarithmic bounds for Roth's theorem via almost-periodicity (Q5211003) (← links)
- The analytic rank of tensors and its applications (Q5211006) (← links)
- Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$ (Q5857007) (← links)
- Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\) (Q6041804) (← links)
- Exponentially larger affine and projective caps (Q6075460) (← links)
- The Kelley-Meka bounds for sets free of three-term arithmetic progressions (Q6179071) (← links)