On sequences with a prescribed number of pairwise sums
HTML articles powered by AMS MathViewer
- by S. L. G. Choi PDF
- Proc. Amer. Math. Soc. 51 (1975), 307-312 Request permission
Abstract:
In this paper we obtain an estimate, which is substantially best possible, for the number of distinct pairs of subsets $\mathcal {A},\mathcal {B}$ of $\{ 1, \ldots ,n\}$, each consisting of $k$ integers, so that the number of elements in $\mathcal {A} + \mathcal {B}$ satisfies a prescribed upper bound.References
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 51 (1975), 307-312
- MSC: Primary 10L05
- DOI: https://doi.org/10.1090/S0002-9939-1975-0369307-6
- MathSciNet review: 0369307