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 of the finite field , the classical Cauchy-Davenport theorem gives a lower bound for the size of the sumset in terms of the sizes of the sets and . Our theorem considers a general linear map , and subsets , and gives a lower bound on the size of in terms of the sizes of the sets . Our proof uses Alon's Combinatorial Nullstellensatz and a variation of the polynomial method.
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