Bibliographic Details
| Title: |
AN IMPROVEMENT OF THE CONDITION FOR A SET OF POSITIVE INTEGERS TO BE SUBSET-SUM-DISTINCT. |
| Authors: |
Kamiyama, Yasulliko1 kamiyama@cs.u-ryukyu.ac.jp |
| Source: |
Advances & Applications in Discrete Mathematics. Nov2025, Vol. 42 Issue 8, p787-798. 12p. |
| Subjects: |
Integers, Number theory, Combinatorial optimization, Mathematics, Mathematical optimization, Combinatorics |
| Abstract: |
Let S be a set of positive integers. Then we say that S is a subset-sumdistinct set (briefly, S is an SSD-set) if for any two finite subsets X, Y of S, -X = Y. For fixed positive integers n and p, we set S, (n,p) : ={1p, 2p, 3p, ..., n} In our previous paper, we proved that S(,n, p) is an SSD-set when p > n. In this paper, we improve the bound as p > 0.71n. [ABSTRACT FROM AUTHOR] |
|
Copyright of Advances & Applications in Discrete Mathematics is the property of Pushpa Publishing House and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
