Back to Search
Start Over
On the Number ofBh-Sets
- Source :
- Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual), Universidade de São Paulo (USP), instacron:USP
- Publication Year :
- 2015
- Publisher :
- Cambridge University Press (CUP), 2015.
-
Abstract
- A setAof positive integers is aBh-setif all the sums of the forma1+ . . . +ah, witha1,. . .,ah∈Aanda1⩽ . . . ⩽ah, are distinct. We provide asymptotic bounds for the number ofBh-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 ofBh-sets. We also use these results to estimate the maximum size of aBh-sets contained in a typical (random) subset of [n] with a given cardinality.
- Subjects :
- Statistics and Probability
Applied Mathematics
MÉTODOS PROBABILÍSTICOS
010102 general mathematics
Of the form
Context (language use)
0102 computer and information sciences
01 natural sciences
Theoretical Computer Science
Set (abstract data type)
Combinatorics
Computational Theory and Mathematics
010201 computation theory & mathematics
Interval (graph theory)
Cardinality (SQL statements)
Maximum size
0101 mathematics
Mathematics
Subjects
Details
- ISSN :
- 14692163 and 09635483
- Volume :
- 25
- Database :
- OpenAIRE
- Journal :
- Combinatorics, Probability and Computing
- Accession number :
- edsair.doi.dedup.....9afb0b8bb87a9e0668e3a4866d396cc0
- Full Text :
- https://doi.org/10.1017/s0963548315000206