Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. The difference between consecutive primes;Baker;Proc. London Math. Soc. (3),1996
2. Theorems in the additive theory of numbers;Bose;Comment. Math. Helv.,1963
3. An upper bound for B2[2] sequences;Cilleruelo;J. Combin. Theory Ser. A,2000
4. J. Cilleruelo, I. Ruzsa, and, C. Trujillo, Upper and lower bounds for finite Bh[g] sequences, g>1, J. Number Theory, in press.
5. On a problem of Sidon in additive number theory and some related problems;Erdős;J. London Math. Soc.,1941
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. g-SIDON MODULAR SETS AND g-GOLOMB MODULAR RULERS;JP Journal of Algebra, Number Theory and Applications;2017-08-21
2. Generalized Sidon sets;Advances in Mathematics;2010-12
3. An upper bound for B2[g] sets;Journal of Number Theory;2007-01
4. Additive Combinatorics;CAM ST AD M;2006