Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-25T19:29:33.454Z Has data issue: false hasContentIssue false
  • English
  • Français

Subset sums in ℕ2

Published online by Cambridge University Press:  12 September 2008

Norbert Hegyvári
Norbert Hegyvári
Affiliation:
ELTE TFK, Department of Mathematics, University Eötvös L., Budapest, H-1055 Markó u. 29, Hungary
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 5 , Issue 4 , December 1996 , pp. 393 - 402
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Folkmaii, J. (1966) On the representation of integers as sums of distinct terms from a fixed sequence. Can. J. Math. 18 643–655.CrossRefGoogle Scholar
[2]Sárközy, A. Personal communication.Google Scholar
[3]Burr, S. and Erdős, P. (1981) Completeness properties of perturbed sequence. J. Number Theory 13 446–455.CrossRefGoogle Scholar
[4]Cassels, J. W. S. (1960) On the representation of integers as the sums taken from a fixed set. Ada Sci. Maths. Szeged 21 111–124.Google Scholar
[5]Hegyvári, N. (1996) Complete sequences in N2. Euro. J. Comb. (in press).CrossRefGoogle Scholar
[6]Erdős, P. (1962) On the representation of large integers as sums of distinct summands taken from a fixed set. Ada Arith. (7) 345–354.CrossRefGoogle Scholar