18 problems
- 0 votes0 replies0 views
Erdős's distinct subset sums conjecture
Let have distinct subset sums (SSD), meaning that all sums of subsets of are distinct. The problem asks for the maximum possible cardinality of …
- 0 votes0 replies0 views
Folkman's conjecture on square-root-density sequences being subcomplete
Folkman's conjecture. There is a constant such that every increasing sequence satisfying
- 0 votes0 replies0 views
Erdős's completeness conjecture for dense sequences
Erdős's conjecture. There is a constant such that every increasing sequence satisfying
- 0 votes0 replies0 views
Folkman's conjecture on dense sequences and subcompleteness
Folkman's conjecture. There is a constant such that, if for all sufficiently large , then is subcomplete.
- 0 votes0 replies0 views
Folkman's conjecture on dense sequences being subcomplete
Folkman's conjecture. A sufficiently dense sequence of positive integers, with possible repetitions, is subcomplete.
- 0 votes0 replies0 views
The growth-rate conjecture for sets with few subset sums in dimension three
Growth-rate conjecture. We have
- 0 votes0 replies0 views
Equidistribution conjecture for subset sums in cyclic groups
Equidistribution conjecture. The subset sums of -element subsets of the cyclic group should satisfy
- 0 votes0 replies0 views
Conway–Guy conjecture on the optimality of their distinct-subset-sum sequence
Conway–Guy conjecture. All sets arising from the Conway–Guy construction have distinct subset sums and are close to the best possible with respect to their largest element.
- 0 votes0 replies1 view
Erdős's exponential lower-bound conjecture for distinct subset sums
Erdős's conjecture. There is a constant such that
- 0 votes0 replies0 views
Modular Erdős distinct subset sums conjecture
Let be fixed and let be sufficiently large. Set , and let be an -element set of positive integers whose subset sums are all distinct modulo . Modul…
- 0 votes0 replies0 views
Erdős's conjecture on the largest weight in distinct-subset-sum sets
Let be a set of weights with all distinct subset sums, meaning that the subset sums of are pairwise distinct. Let denote the…
- 0 votes0 replies0 views
Alon's asymptotic conjecture for sets avoiding a subset sum
Alon's conjecture. In roughly the range , one has
- 0 votes0 replies1 view
The optimal anticoncentration bound for the number of subset sums
Conjecture on the optimal bound. The example consisting of groups of repeated coordinates is essentially the worst possible, so that
- 0 votes0 replies0 views
Erdős's distinct subset sums conjecture
Erdős's conjecture. There is a constant such that
- 0 votes0 replies0 views
The multiple-free subset-sum conjecture for powers of two
Let and let , where . For each non-empty subset of , write for the sum of its eleme…
- 0 votes0 replies0 views
Modified maximum subset-divisor conjecture
Let be a finite set of positive integers, let be the number of -subsets of satisfying , and let be the maximum of ov…
- 0 votes0 replies0 views
Anti-pencil conjecture for the maximum number of non-negative-sum subsets
Anti-pencil conjecture. If , then
- 0 votes0 replies0 views
The subset-sum lower-bound conjecture for finite abelian groups
Let be a finite abelian group, and let be a subset. For a subset of an abelian group, write for its set of subset sums, and say tha…