Combinatorics, Probability and Computing
A lower bound for the size of a minkowski sum of dilates
Combinatorics, Probability and Computing
Sums of dilates in groups of prime order
Combinatorics, Probability and Computing
Yahya Ould Hamidoune's mathematical journey: A critical review of his work
European Journal of Combinatorics
European Journal of Combinatorics
Hi-index | 0.00 |
For k prime and A a finite set of integers with |A| ≥ 3(k − 1)2(k − 1)! we prove that |A + k · A| ≥ (k + 1)|A| − ⌈k(k + 2)/4⌉ where k · A = {ka: a ∈ A}. We also describe the sets for which equality holds.