A refinement of Chang's lemma that adds cosetwise l1 control on correlations outside the large spectrum subspace, producing a localized counting lemma for subsets of finite abelian groups.
2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A strengthening of Chang's lemma
A refinement of Chang's lemma that adds cosetwise l1 control on correlations outside the large spectrum subspace, producing a localized counting lemma for subsets of finite abelian groups.