We give a lower bound on the maximal element in a multiple difference set.
Lower bounds on multiple distinct sums sets
✍ Scribed by Wende Chen; Torleiv Kløve
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 590 KB
- Volume
- 148
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Improved lower bounds on multiple distinct sums sets are given. Lower bounds for the more general case of multiple difference set of a distinct sum set are considered.
📜 SIMILAR VOLUMES
The purpose of this paper is to extend results of Stepanov (1980;1994) about lower bounds for incomplete character sums over a prime finite field F p to the case of arbitrary finite field F q .
A set A [1, ..., N] is of the type B 2 if all sums a+b, with a b, a, b # A, are distinct. It is well known that the largest such set is of size asymptotic to N 1Â2 . For a B 2 set A of this size we show that, under mild assumptions on the size of the modulus m and on the difference N 1Â2 &| A | (the