ON SUBSET SUMS OF R-SETS

被引：0
|
作者：
LIPKIN, E
机构：
[1] School of Mathematical Sciences, Raymund and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University
来源：
DISCRETE MATHEMATICS | 1993年 / 114卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(93)90378-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A finite set of distinct integers is called an r-set if it contains at least r elements not divisible by q for each q≥2. Let f(n,r) denote the maximum cardinality of an r-set A ⊂ {1,2,...,n} having no subset sum Σεiai(εi=0 or 1, aiε{lunate}A) equal to a power of two. In this paper estimates for f(n,r) are obtained. We prove that limr→∞ αr=0, where αr=limn→∞ f(n,r) n. This result verifies a conjecture of Erdős and Freiman (1990). © 1993.
引用
收藏
页码：367 / 377
页数：11
相关论文
共 50 条
  • [1] R-SETS OF FRACTIONS
    ALLOUCH, DA
    BULLETIN DES SCIENCES MATHEMATIQUES, 1976, 100 (02): : 97 - 112
  • [2] R-SETS AND CATEGORY
    BARUA, R
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1984, 286 (01) : 125 - 158
  • [3] UNCOUNTABLE R-SETS AND N-SETS
    KHOLSHCHEVNIKOVA, NN
    MATHEMATICAL NOTES, 1985, 38 (1-2) : 660 - 664
  • [4] Isoperimetric problems for r-sets
    Bollobás, B
    Leader, I
    COMBINATORICS PROBABILITY & COMPUTING, 2004, 13 (02): : 277 - 279
  • [5] An approximate isoperimetric inequality for r-sets
    Christofides, Demetres
    Ellis, David
    Keevash, Peter
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (04):
  • [6] Subset sums of sets of residues
    Lipkin, E
    ASTERISQUE, 1999, (258) : 187 - 193
  • [7] SUB R-SETS OF AN R-SET OF QUOTIENTS
    ALLOUCH, D
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1974, 278 (23): : 1479 - 1482
  • [8] ON STRUCTURE OF MAXIMAL R-SETS OF A HILBERT SPACE
    LUFT, E
    MATHEMATISCHE ANNALEN, 1968, 175 (03) : 220 - &
  • [9] ACTIONS OF PERMUTATION-GROUPS ON R-SETS
    MCKAY, J
    REGENER, E
    COMMUNICATIONS IN ALGEBRA, 1985, 13 (03) : 619 - 630
  • [10] Metric Dimension and R-Sets of Connected Graphs
    Ioan Tomescu
    Muhammad Imran
    Graphs and Combinatorics, 2011, 27 : 585 - 591
12345