Abstract
Let A be a subset of the lattice Ñ x N. We answer a question of Sárközy, proving if A is well distributed then the set of subset sums of A contains an infinite arithmetic progression.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference6 articles.
1. On the representation of integers as the sums taken from a fixed set;Cassels;Ada Sci. Maths. Szeged,1960
2. Completeness properties of perturbed sequences
3. [2] Sárközy A. Personal communication.
4. On the Representation of Integers as Sums of Distinct Terms from a Fixed Sequence
5. Complete Sequences inN2
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On a communication complexity problem in combinatorial number theory;Moscow Journal of Combinatorics and Number Theory;2021-12-31
2. Erdős–Birch type question inNr;Journal of Number Theory;2018-06