Skip to main content Accessibility help
×
Home
Hostname: page-component-55597f9d44-mzfmx Total loading time: 0.359 Render date: 2022-08-13T22:36:44.328Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

On the Number of Bh-Sets

Published online by Cambridge University Press:  16 September 2015

DOMINGOS DELLAMONICA Jr
Affiliation:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail: domingos.junior@gmail.com, rodl@mathcs.emory.edu)
YOSHIHARU KOHAYAKAWA
Affiliation:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail: domingos.junior@gmail.com, rodl@mathcs.emory.edu) Instituto de Matemática e Estatística, Universidade de São Paulo, Rua do Matão 1010, 05508-090 São Paulo, Brazil (e-mail: yoshi@ime.usp.br)
SANG JUNE LEE
Affiliation:
Department of Mathematics, Duksung Women's University, Seoul 132-714, South Korea (e-mail: sanglee242@duksung.ac.kr, sjlee242@gmail.com)
VOJTĚCH RÖDL
Affiliation:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail: domingos.junior@gmail.com, rodl@mathcs.emory.edu)
WOJCIECH SAMOTIJ
Affiliation:
School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel and Trinity College, Cambridge CB2 1TQ, UK (e-mail: samotij@post.tau.ac.il)

Abstract

A set A of positive integers is a Bh-set if all the sums of the form a1 + . . . + ah, with a1,. . .,ahA and a1 ⩽ . . . ⩽ ah, are distinct. We provide asymptotic bounds for the number of Bh-sets of a given cardinality contained in the interval [n] = {1,. . .,n}. As a consequence of our results, we address a problem of Cameron and Erdős (1990) in the context of Bh-sets. We also use these results to estimate the maximum size of a Bh-sets contained in a typical (random) subset of [n] with a given cardinality.

Type
Paper
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Alon, N., Balogh, J., Morris, R. and Samotij, W. (2014) Counting sum-free sets in Abelian groups. Israel J. Math. 199 309344.CrossRefGoogle Scholar
[2]Bose, R. C. and Chowla, S. (1962/1963) Theorems in the additive theory of numbers. Comment. Math. Helv. 37 141147.CrossRefGoogle Scholar
[3]Cameron, P. J. and Erdős, P. (1990) On the number of sets of integers with various properties. In Number Theory (Banff 1988), de Gruyter, pp. 61–79.Google Scholar
[4]Chen, S. (1994) On the size of finite Sidon sequences. Proc. Amer. Math. Soc. 121 353356.CrossRefGoogle Scholar
[5]Chowla, S. (1944) Solution of a problem of Erdős and Turán in additive-number theory. Proc. Nat. Acad. Sci. India. Sect. A 14 12.Google Scholar
[6]Cilleruelo, J. (2001) New upper bounds for finite Bh sequences. Adv. Math. 159 117.CrossRefGoogle Scholar
[7]Conlon, D. and Gowers, W. T. (2010) Combinatorial theorems in sparse random sets. Submitted.Google Scholar
[8]D'yachkov, A. G. and Rykov, V. V. (1984) Bs-sequences. Mat. Zametki 36 593601.Google Scholar
[9]Erdős, P. (1944) On a problem of Sidon in additive number theory and on some related problems: Addendum. J. London Math. Soc. 19 208.CrossRefGoogle Scholar
[10]Erdős, P. and Turán, P. (1941) On a problem of Sidon in additive number theory, and on some related problems. J. London Math. Soc. 16 212215.CrossRefGoogle Scholar
[11]Green, B. (2001) The number of squares and Bh[g] sets. Acta Arith. 100 365390.CrossRefGoogle Scholar
[12]Halberstam, H. and Roth, K. F. (1983) Sequences, second edition, Springer.CrossRefGoogle Scholar
[13]Hardy, G. H., Littlewood, J. E. and Polya, G. (1934) Inequalities, Cambridge University Press.Google Scholar
[14]Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience.CrossRefGoogle Scholar
[15]Jia, X. D. (1993) On finite Sidon sequences. J. Number Theory 44 8492.CrossRefGoogle Scholar
[16]Kleitman, D. J. and Wilson, D. B. (1996) On the number of graphs which lack small cycles. Unpublished Manuscript.Google Scholar
[17]Kleitman, D. J. and Winston, K. J. (1982) On the number of graphs without 4-cycles. Discrete Math. 41 167172.CrossRefGoogle Scholar
[18]Kohayakawa, Y., Lee, S. J., Rödl, V. and Samotij, W. (2015) The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Alg. 46 125.CrossRefGoogle Scholar
[19]Kohayakawa, Y., Lee, S. and Rödl, V. (2011) The maximum size of a Sidon set contained in a sparse random set of integers. In Proc. Twenty-Second Annual ACM–SIAM Symposium on Discrete Algorithms (Philadelphia, PA), SIAM, pp. 159–171.CrossRefGoogle Scholar
[20]Kohayakawa, Y., Łuczak, T. and Rödl, V. (1996) Arithmetic progressions of length three in subsets of a random set. Acta Arith. 75 133163.CrossRefGoogle Scholar
[21]Kolountzakis, M. N. (1996) The density of Bh[g] sequences and the minimum of dense cosine sums. J. Number Theory 56 411.CrossRefGoogle Scholar
[22]Krückeberg, F. (1961) B 2-Folgen und verwandte Zahlenfolgen. J. Reine Angew. Math. 206 5360.Google Scholar
[23]Lee, S. J. On Sidon sets in a random set of vectors. J. Korean Math. Soc., to appear.Google Scholar
[24]Lindström, B. (1969) A remark on B 4-sequences. J. Combin. Theory 7 276277.CrossRefGoogle Scholar
[25]O'Bryant, K. (2004) A complete annotated bibliography of work related to Sidon sequences. Electron. J. Combin. Dynamic Surveys 11 (electronic).Google Scholar
[26]Roth, K. F. (1953) On certain sets of integers. J. London Math. Soc. 28 104109.CrossRefGoogle Scholar
[27]Saxton, D. and Thomason, A. (2015) Hypergraph containers, Invent. Math., 201 925992CrossRefGoogle Scholar
[28]Schacht, M. Extremal results for random discrete structures. Submitted.Google Scholar
[29]Shparlinskii, I. E. (1986) On Bs-sequences. In Combinatorial Analysis, no. 7 (Russian), Moscow State University, pp. 4245.Google Scholar
[30]Singer, J. (1938) A theorem in finite projective geometry and some applications to number theory. Trans. Amer. Math. Soc. 43 377385.CrossRefGoogle Scholar
[31]Szemerédi, E. (1975) On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27 199245.CrossRefGoogle Scholar
8
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On the Number of Bh-Sets
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

On the Number of Bh-Sets
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

On the Number of Bh-Sets
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *