On the critical values in subset sum

被引:4
|
作者
Fang, Jin-Hui [1 ]
Fang, Zhi-Kai [1 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Dept Math, Nanjing 210044, Peoples R China
基金
中国国家自然科学基金;
关键词
INVERSE PROBLEM;
D O I
10.1016/j.ejc.2020.103158
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For a sequence A of positive integers, let P(A) be the set of all integers which can be represented as the finite sum of distinct terms of A. In 2012, Chen and Fang proved that, for a sequence of integers B = {b(1) < b(2) < ...}, if b(1) is an element of {4, 7, 8}boolean OR{b : b >= 11, b is an element of N} and b(n +1) >= 3b(n) + 5 for all n >= 1, then there exists an infinite sequence A of positive integers for which P(A) = N \ B; on the other hand, if b(2) = 3b(1) + 4, then such A does not exist. Recently, for b(2) = 3b(1) + 5, the authors determined the critical value for b(3) such that there exists an infinite sequence A of positive integers for which P(A) = N \ B. In this paper, we fix the exact critical values for the above general terms. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] FURTHER CRITICAL VALUES FOR THE SUM OF 2 VARIANCES
    HUITSON, A
    BIOMETRIKA, 1958, 45 (1-2) : 279 - 282
  • [2] Approximating Subset Sum Ratio faster than Subset Sum
    Bringmann, Karl
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 1260 - 1277
  • [3] Approximating Subset Sum Ratio via Subset Sum Computations
    Alonistiotis, Giannis
    Antonopoulos, Antonis
    Melissinos, Nikolaos
    Pagourtzis, Aris
    Petsalakis, Stavros
    Vasilakis, Manolis
    COMBINATORIAL ALGORITHMS (IWOCA 2022), 2022, 13270 : 73 - 85
  • [4] The Subset Sum game
    Darmann, Andreas
    Nicosia, Gaia
    Pferschy, Ulrich
    Schauer, Joachim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 233 (03) : 539 - 549
  • [5] Critical objective function values in linear sum assignment problems
    Ivan Belik
    Kurt Jornsten
    Journal of Combinatorial Optimization, 2018, 35 : 842 - 852
  • [6] Critical objective function values in linear sum assignment problems
    Belik, Ivan
    Jornsten, Kurt
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (03) : 842 - 852
  • [7] An improved approximation to the estimation of the critical F values in best subset regression
    Salt, David W.
    Ajmani, Subhash
    Crichton, Ray
    Livingstone, David J.
    JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2007, 47 (01) : 143 - 149
  • [8] On the variance of subset sum estimation
    Szegedy, Mario
    Thorup, Mikkel
    ALGORITHMS - ESA 2007, PROCEEDINGS, 2007, 4698 : 75 - +
  • [9] Subset Sum in the Absence of Concentration
    Austrin, Per
    Kaski, Petteri
    Koivisto, Mikko
    Nederlof, Jesper
    32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 48 - 61
  • [10] A subset-sum inequality
    Stong, R
    AMERICAN MATHEMATICAL MONTHLY, 2006, 113 (03): : 269 - 270