Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > RESTRICTES APS:
Reports tagged with restrictes APs:
TR26-149 | 18th August 2026
Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer

A Counting Lemma for Somewhat Restricted 3-APs

For a prime $p\geq 3$, a somewhat restricted $3$-AP in $\mathbb{F}_p^n$ is a triplet $(x,x+a,x+2a)$, where $x\in\mathbb{F}_p^n$ and $a\in \{0,1,2\}^n$. We prove a counting lemma for somewhat restricted $3$-APs in dense sets in $\mathbb{F}_p^n$. More precisely, we prove that for all $\alpha>0$, there exists $\beta>0$, such that for sufficiently large ... more >>>




ISSN 1433-8092 | Imprint