A subset A of the set [n]=[1, 2, ..., n], |A| =k, is said to form a Sidon (or B h ) sequence, h 2, if each of the sums a 1 +a 2 + } } } +a h , a 1 a 2 } } } a h ; a i # A, are distinct. We investigate threshold phenomena for the Sidon property, showing that if A n is a random subset of [n], then the
On Finite Sidon Sequences
β Scribed by X.D. Jia
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 211 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
A set (A) of integers is called a (B_{h})-sequence if all sums (a_{1}+\cdots+a_{h}), where (a_{i} \in A), are distinct up to rearrangement of the summands. Let (F_{h}(n)) (resp. (\left.f_{h}(n)\right)) denote the size of a largest (B_{h})-sequence (resp. (B_{h})-sequence for (\mathbf{Z} /(n)) ). It is proved that, for every (r \geqslant 1) as (n \rightarrow \infty, F_{2 r}(n) \leqslant r^{1 /(2 r)}(r!)^{1 / r} n^{1 / 2 r)}+O\left(n^{1 / 4 r}\right), f_{2 r}(n) \leqslant(r!)^{1 / r} n^{1 / 2 r)}+) (O\left(n^{1 /(4 r)}\right)). Some open problems concerning (B_{h})-sequences are also discussed in this paper. 1993 Academic Press, Inc.
π SIMILAR VOLUMES
We show the existence of an infinite Sidon sequence such that the number of elements in [1, N] is N -2&1+o(1) for all large N.