An extremal problem for subset-sum-distinct sequences with congruence conditions
From MaRDI portal
Publication:1584356
Recommendations
Cites work
- A sum packing problem of Erdös and the Conway-Guy sequence
- An improved lower bound on the greatest element of a sum-distinct set of fixed order
- scientific article; zbMATH DE number 3121715 (Why is no real title available?)
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1230579 (Why is no real title available?)
- scientific article; zbMATH DE number 683826 (Why is no real title available?)
- scientific article; zbMATH DE number 903683 (Why is no real title available?)
- Integer Sets with Distinct Subset-Sums
- On Weird and Pseudoperfect Numbers
- Sets of Integers Whose Subsets Have Distinct Sums
- Shorter Notes: Distinct Sums over Subsets
Cited in
(6)- Classification of greedy subset-sum-distinct-sequences.
- An extremal problem in subsequence sum
- Approximating the maximum consecutive subsums of a sequence
- scientific article; zbMATH DE number 5014481 (Why is no real title available?)
- scientific article; zbMATH DE number 1230579 (Why is no real title available?)
- ON MAXIMAL SUBSET-SUM-DISTINCT SEQUENCES
This page was built for publication: An extremal problem for subset-sum-distinct sequences with congruence conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584356)