Journal of the Korean Mathematical Society (대한수학회지)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

ON SIDON SETS IN A RANDOM SET OF VECTORS

  • Lee, Sang June (Department of Mathematics Duksung Women's University)
  • Received : 2014.05.07
  • Published : 2016.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

For positive integers d and n, let $[n]^d$ be the set of all vectors ($a_1,a_2,{\cdots},a_d$), where ai is an integer with $0{\leq}a_i{\leq}n-1$. A subset S of $[n]^d$ is called a Sidon set if all sums of two (not necessarily distinct) vectors in S are distinct. In this paper, we estimate two numbers related to the maximum size of Sidon sets in $[n]^d$. First, let $\mathcal{Z}_{n,d}$ be the number of all Sidon sets in $[n]^d$. We show that ${\log}(\mathcal{Z}_{n,d})={\Theta}(n^{d/2})$, where the constants of ${\Theta}$ depend only on d. Next, we estimate the maximum size of Sidon sets contained in a random set $[n]^d_p$, where $[n]^d_p$ denotes a random set obtained from $[n]^d$ by choosing each element independently with probability p.

Keywords

References

  1. S. Chowla, Solution of a problem of Erdos and Turan in additive-number theory, Proc. Nat. Acad. Sci. India. Sect. A. 14 (1944), 1-2.
  2. J. Cilleruelo, Sidon sets in ${\mathbb{N}}^d$, J. Combin. Theory Ser. A 117 (2010), no. 7, 857-871. https://doi.org/10.1016/j.jcta.2009.12.003
  3. P. Erdos, On a problem of Sidon in additive number theory and on some related problems. Addendum, J. Lond. Math. Soc. 19 (1944), 208.
  4. P. Erdos and P. Turan, On a problem of Sidon in additive number theory, and on some related problems, J. Lond. Math. Soc. 16 (1941), 212-215.
  5. H. Halberstam and K. F. Roth, Sequences, Second ed., Springer-Verlag, New York, 1983.
  6. Y. Kohayakawa, S. Lee, and V. Rodl, The maximum size of a Sidon set contained in a sparse random set of integers, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 159-171, SIAM, Philadelphia, PA, 2011.
  7. Y. Kohayakawa, S. J. Lee, V. Rodl, and W. Samotij, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, Random Structures Algorithms 46 (2015), no. 1, 1-25. https://doi.org/10.1002/rsa.20496
  8. B. Lindstrom, An inequality for $B_2$-sequences, J. Combin. Theory 6 (1969), 211-212. https://doi.org/10.1016/S0021-9800(69)80124-9
  9. B. Lindstrom, On $B_2$-sequences of vectors, J. Number Theory 4 (1972), 261-265. https://doi.org/10.1016/0022-314X(72)90052-2
  10. M.Mitzenmacher and E. Upfal, Probability and Computing, Cambridge University Press, Cambridge, 2005.
  11. K. O'Bryant, A complete annotated bibliography of work related to Sidon sequences, Electron. J. Combin. (2004), Dynamic surveys 11, 39 pp.
  12. J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc. 43 (1938), no. 3, 377-385. https://doi.org/10.1090/S0002-9947-1938-1501951-4

Cited by

  1. The number of Bh-sets of a given cardinality vol.116, pp.3, 2017, https://doi.org/10.1112/plms.12082