Cauchy-Davenport Theorem for linear maps: Simplification and Extension
classification
🧮 math.CO
keywords
lineartheoremcauchy-davenportmapsproofboundcombinatorialextension
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.