Sums in the grid
Abstract
Let A and B be down-sets in the grid [k]n = {0, ... , k - 1}n. Given the sizes of A and B, how small can A + B = {a + b ∈ [k]n: a ∈ A, b ∈ B} be? Our main aim in this paper is to give a best-possible lower bound for |A + B| in terms of |A| and |B|. For example, although if |A| = |B| = kn-1 we may have |A + B| = kn-1, we show that if |A| = |B| = kn-1 + 1 then |A + B| ≥ 2kn-1 + 1.
Publication Title
Discrete Mathematics
Recommended Citation
Bollobás, B., & Leader, I. (1996). Sums in the grid. Discrete Mathematics, 162 (1-3), 31-48. https://doi.org/10.1016/S0012-365X(96)00303-2
COinS
