Low-complexity approximations for sets defined by generalizations of affine conditions
Abstract
Let p be a prime, let S be a non-empty subset of Fp and let 0<ε≤ 1. We show that there exists a constant C=C(p, ε) such that for every positive integer k, whenever φ1, …, φk: Fpn → Fp are linear forms and E1, …, Ek are subsets of Fp, there exist linear forms 1, …, C: Fpn → Fp and subsets F1, …, FC of Fp such that the set U=\x ∈ Sn: 1(x) ∈ F1, …, C(x) ∈ FC\ is contained inside the set V=\x ∈ Sn: φ1(x) ∈ E1, …, φk(x) ∈ Ek\, and the difference V U has density at most ε inside Sn. We then generalize this result to one where φ1, …, φk are replaced by homomorphisms Gn H for some pair of finite Abelian groups G and H, and to another where they are replaced by polynomial maps Fpn Fp of small degree.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.