Variants of the Erdős distinct sums problem and variance method
From MaRDI portal
Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)
Cites work
- A construction for sets of integers with distinct subset sums
- A Note on the Erdös Distinct Subset Sums Problem
- An improved lower bound on the greatest element of a sum-distinct set of fixed order
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Higher Degree Davenport Constants over Finite Commutative Rings
- scientific article; zbMATH DE number 3121715 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 903683 (Why is no real title available?)
- scientific article; zbMATH DE number 7633017 (Why is no real title available?)
- Integer Sets with Distinct Subset-Sums
- Sets of Integers Whose Subsets Have Distinct Sums
- Siegel's Lemma and sum-distinct sets
- Sum-distinguishing number of sparse hypergraphs
- The probabilistic method
- Unsolved problems in number theory
- Variations on the Erdős distinct-sums problem
This page was built for publication: Variants of the Erdős distinct sums problem and variance method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995805)