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:Fpn→FpmL: \mathbb{F}_p^n \to \mathbb{F}_p^m, and subsets A1,…,An⊆FpA_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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.