John Kim, Aditya Potukuchi
Published 2016-12-29Version 1
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.
Lower bound on the number of the maximum genus embedding of $K_{n,n}$
On the number of 1-perfect binary codes: a lower bound
Cube packings, second moment and holes
![QR code for arXiv:1612.09217 [math.CO]](http://oss.arxitics.com/images/favicon.svg)