A Cauchy-Davenport theorem for linear maps

Abstract

We prove a version of the Cauchy-Davenport theorem for general linear maps. For subsets A,B of the finite field Fp, the classical Cauchy-Davenport theorem gives a lower bound for the size of the sumset A+B in terms of the sizes of the sets A and B. Our theorem considers a general linear map L: Fpn Fpm, and subsets A1, …, An ⊂eq Fp, and gives a lower bound on the size of L(A1 × A2 × … × An) in terms of the sizes of the sets A1, …, An. Our proof uses Alon's Combinatorial Nullstellensatz and a variation of the polynomial method.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…