English

Low-complexity approximations for sets defined by generalizations of affine conditions

Combinatorics 2023-06-02 v1 Group Theory Number Theory

Abstract

Let pp be a prime, let SS be a non-empty subset of Fp\mathbb{F}_p and let 0<ϵ10<\epsilon\leq 1. We show that there exists a constant C=C(p,ϵ)C=C(p, \epsilon) such that for every positive integer kk, whenever ϕ1,,ϕk:FpnFp\phi_1, \dots, \phi_k: \mathbb{F}_p^n \rightarrow \mathbb{F}_p are linear forms and E1,,EkE_1, \dots, E_k are subsets of Fp\mathbb{F}_p, there exist linear forms ψ1,,ψC:FpnFp\psi_1, \dots, \psi_C: \mathbb{F}_p^n \rightarrow \mathbb{F}_p and subsets F1,,FCF_1, \dots, F_C of Fp\mathbb{F}_p such that the set U={xSn:ψ1(x)F1,,ψC(x)FC}U=\{x \in S^n: \psi_1(x) \in F_1, \dots, \psi_C(x) \in F_C\} is contained inside the set V={xSn:ϕ1(x)E1,,ϕk(x)Ek}V=\{x \in S^n: \phi_1(x) \in E_1, \dots, \phi_k(x) \in E_k\}, and the difference VUV \setminus U has density at most ϵ\epsilon inside SnS^n. We then generalize this result to one where ϕ1,,ϕk\phi_1, \dots, \phi_k are replaced by homomorphisms GnHG^n \to H for some pair of finite Abelian groups GG and HH, and to another where they are replaced by polynomial maps FpnFp\mathbb{F}_p^n \to \mathbb{F}_p of small degree.

Keywords

Cite

@article{arxiv.2306.00747,
  title  = {Low-complexity approximations for sets defined by generalizations of affine conditions},
  author = {W. T. Gowers and Thomas Karam},
  journal= {arXiv preprint arXiv:2306.00747},
  year   = {2023}
}

Comments

26 pages

R2 v1 2026-06-28T10:53:26.452Z