Zander Kelley

collaborators

2 papers

cs.CC2026

More efficient sifting for grid norms, and applications to multiparty communication complexity

Zander Kelley, Xin Lyu

Building on the techniques behind the recent progress on the 3-term arithmetic progression problem \cite{KelleyM2023strong}, Kelley, Lovett, and Meka \cite{KelleyLM2024-nof} constr…

math.NT2024

Strong Bounds for 3-Progressions

Zander Kelley, Raghu Meka

We show that for some constant $I^^{2} > 0$ , any subset $A$ of integers ${1, \dots, N}$ of size at least $2^{- O ((l o g N)^{2})} \cdot N$ contains a non-trivial three-term arithmetic prog…