Cauchy-Davenport Theorem for linear maps: Simplification and Extension
Combinatorics
2016-12-30 v1
Abstract
We give a new proof of the Cauchy-Davenport Theorem for linear maps given by Herdade et al., (2015). This theorem gives a lower bound on the size of the image of a linear map on a grid. Our proof is purely combinatorial and offers a partial insight into the range of parameters not handled previously.
Cite
@article{arxiv.1612.09217,
title = {Cauchy-Davenport Theorem for linear maps: Simplification and Extension},
author = {John Kim and Aditya Potukuchi},
journal= {arXiv preprint arXiv:1612.09217},
year = {2016}
}
Comments
7 pages