Subset sums
Let \(f(n,m)\), \(m\geq 1\), denote the maximal cardinality of a subset \(B\) of \(A\) of \(\{\) 1,2,...,n\(\}\) such that no subset \(B\) of \(A\) adds up to \(m\). Erdős and Graham proved that \(f(n,m)\geq (+o(1))n\) for all \(n, m\). Let \(A\) be a subset of residues mod \(n\), with cardinality \(| A| >[1/k+\varepsilon] n\), \(n>n_ 0(k,\varepsilon)\). The author proves that there exists a non-empty subset \(B\) of \(A\), \(| B| \leq k\), with \(\sum_{b\in B}b\equiv 0 \pmod n\), and deduces that \(f(n,2n)=(1/3+o(1))n\), thus settling a problem of Erdős and Graham. He also obtains some near best possible estimates for \(f(n,m)\) when \(n^{1+\varepsilon}\leq m\leq n^ 2/\log^ 2 n\) and conjectures that a stronger result holds.
- An addition theorem modulo p
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- Integer Sets Containing No Arithmetic Progressions
- On Certain Sets of Integers
- On the Addition of Residue Classes
- On the addition of residue classes mod p
- A new result on Davenport constant
- On sums of subsets of a set of integers
- On the subsets product in finite groups
- Subset sums in binary spaces
- t-sum generators of finite Abelian groups
- Intersection of arcs and normal rational curves in spaces of even characteristic
- Representation of elements of a sequence by sumsets
- On an extremal problem in number theory
- Progression-free sets in finite abelian groups.
- When subset-sums do not cover all the residues modulo \(p\).
- Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
- A lattice point problem and additive number theory
- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
- Generalizations of some results about the regularity properties of an additive representation function
- Note on integer powers in sumsets
- Representing powers of 2 by a sum of four integers
- Subset sums in \(\mathbb{N}^ 2\)
- Sumsets and difference sets containing a common term of a sequence
- Sieving by large integers and covering systems of congruences
- Subset sums avoiding quadratic nonresidues
- Balanced subset sums in dense sets of integers
- scientific article; zbMATH DE number 4089636 (Why is no real title available?)
- scientific article; zbMATH DE number 4089661 (Why is no real title available?)
- Sum Zero (\mod n), Size n Subsets of Integers
- Integer sets with distinct subset sums
- scientific article; zbMATH DE number 1300640 (Why is no real title available?)
- scientific article; zbMATH DE number 1042586 (Why is no real title available?)
- On subset sums of a fixed set
- Sum-free sets of integers with a forbidden sum
- Sumsets as unions of sumsets of subsets
- Sommes de sous-ensembles
- Sure monochromatic subset sums
- Sum and difference sets containing integer powers.
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- The structure of higher sumsets
- Perfect Hash Families: Constructions and Existence
- Subset sums modulo a prime
- scientific article; zbMATH DE number 2212148 (Why is no real title available?)
- On the restricted sumsets containing powers of an integer
- On sequences without short zero-sum subsequences
- Behaving sequences
- Optimal result on restricted sumsets containing powers of two
- An optimal lower bound for the size of the restricted sumsets containing powers
- On a conjecture of Alon
- Some new results on subset sums
- On two additive problems
This page was built for publication: Subset sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090706)
