Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SLICE RANK:
Reports tagged with slice rank:
TR26-205 | 22nd September 2026
Sankeerth Rao Karingula, Shachar Lovett

Limitations of the slice rank method in additive combinatorics

The slice rank method gives exponential bounds for sets with no three-term arithmetic progression in finite vector spaces of odd characteristic and for three-sunflower-free families of subsets of a fixed ground set. We show that for $k\ge4$, every tensor that is nonzero exactly on the $k$-term arithmetic progression relation or ... more >>>




ISSN 1433-8092 | Imprint