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 \(\mathb
Random Sidon Sequences
β Scribed by Anant P. Godbole; Svante Janson; Nicholas W. Locantore Jr.; Rebecca Rapoport
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 154 KB
- Volume
- 75
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 probability that A n is a B h sequence tends to unity as n Γ if k n = |A n | < >n 1Γ2h . The main tool employed is the Janson exponential inequality. The validity of the Sidon property at the threshold is studied as well. We prove, using the Stein Chen method of Poisson approximation, that
, where \* is a constant that depends in a wellspecified way on 4. Multivariate generalizations are presented.
1999 Academic Press h ) sums a 1 +a 2 + } } } +a h ,
π 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.