Note on integer powers in sumsets
Let \(k,m,n\geq 2\) be integers and \(A\subset \{0,1,2,\dots,n\}\) with \(0\in A\). The author proves that if the greatest common divisor of all elements of \(A\) is one, \(| A| >(1/(l+1))\left((2-(k/(lm))n+2l)\right)\) where \(l=\lceil k/m\rceil\) and \(m\geq 3\) or \(m=2\) and \(k\) is even, then there exists a power of \(m\) which can be represented as a sum of \(k\) (not necessarily distinct) elements of \(A\). On the other hand, for \(k=2\) he proves a little stronger result: if \(m\geq 2\), \(n\) is a positive integer and \(| A| \geq (1-1/m)n\) if \(n\geq m\geq 4\) with \(m\) even, or \(| A| \geq (1-1/m)n+1\) otherwise, then there exists a power of \(m\) which can be represented as a sum of two (again not necessarily distinct) elements of \(A\). These results extend those of \textit{T. Abe} [Combinatorica 24, No. 1, 1--4 (2004; Zbl 1049.11011)] and \textit{V. F. Lev} [ibid. 16, No. 3, 413--416 (1996; Zbl 0862.11008)].
- scientific article; zbMATH DE number 426337 (Why is no real title available?)
- scientific article; zbMATH DE number 568794 (Why is no real title available?)
- scientific article; zbMATH DE number 933467 (Why is no real title available?)
- On two additive problems
- Representing powers of 2 by a sum of four integers
- Structure theorem for multiple addition and the Frobenius problem
- Subset sums
- Sumsets containing long arithmetic progressions and powers of 2
- Sumsets containing powers of an integer
- On sums which are powers
- On the cardinality of general h-fold sumsets
- Sumsets containing powers of an integer
- Sets whose sumset avoids a thin sequence
- An additive problem about powers of fixed integers
- Sums of powered characteristic roots count distance-independent circular sets
- Representing integers as linear combinations of powers
- On representation of r-th powers by subset sums
- Sumsets and difference sets containing a common term of a sequence
- scientific article; zbMATH DE number 426337 (Why is no real title available?)
- On a sumset problem for integers
- Note on powers of 2 in sumsets
- Representing integers as linear combinations of power products
- Sum and difference sets containing integer powers.
- On the largest integer that is not a sum of distinct positive \(n\)th powers
- Powers of 2 with five distinct summands
- On the restricted sumsets containing powers of an integer
- Congruences for sums of powers of an integer
- Sumsets containing a term of a sequence
- Optimal result on restricted sumsets containing powers of two
- An optimal lower bound for the size of the restricted sumsets containing powers
This page was built for publication: Note on integer powers in sumsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490155)
