English

A Cauchy-Davenport theorem for linear maps

Combinatorics 2015-08-12 v1 Number Theory

Abstract

We prove a version of the Cauchy-Davenport theorem for general linear maps. For subsets A,BA,B of the finite field Fp\mathbb{F}_p, the classical Cauchy-Davenport theorem gives a lower bound for the size of the sumset A+BA+B in terms of the sizes of the sets AA and BB. Our theorem considers a general linear map L:FpnFpmL: \mathbb{F}_p^n \to \mathbb{F}_p^m, and subsets A1,,AnFpA_1, \ldots, A_n \subseteq \mathbb{F}_p, and gives a lower bound on the size of L(A1×A2××An)L(A_1 \times A_2 \times \ldots \times A_n) in terms of the sizes of the sets A1,,AnA_1, \ldots, A_n. Our proof uses Alon's Combinatorial Nullstellensatz and a variation of the polynomial method.

Keywords

Cite

@article{arxiv.1508.02100,
  title  = {A Cauchy-Davenport theorem for linear maps},
  author = {Simao Herdade and John Kim and Swastik Kopparty},
  journal= {arXiv preprint arXiv:1508.02100},
  year   = {2015}
}

Comments

16 pages, 0 figures

R2 v1 2026-06-22T10:29:36.601Z