DOI QR코드

DOI QR Code

ON MAXIMAL SUBSET-SUM-DISTINCT SEQUENCES

  • Bae, Jae-Gug (Department of Applied Mathematics Korea Maritime University)
  • Published : 2002.04.01

Abstract

Since P. Erdos introduced the concept of "subset-sum-distinctness", lots of mathematicians have been interested in a "dense" set having distinct subset sums. In this paper, we establish a couple of theorems on maximal subset-sun-distinct sequence with respect to the set inclusion.

Keywords

References

  1. Analytic number theory Vol.1, Progr.Math. v.138 On subset-sum-distinct sequences J.Bae
  2. Proc.Amer.Math.Soc. v.124 no.12 A sum packing problem of Erdos and the Conway-Guy sequence T.Bohman https://doi.org/10.1090/S0002-9939-96-03653-2
  3. Colloquium Mathematicum v.20 Solution of a problem of P.Erdos J.H.Conway;R.K.Guy
  4. Journal of Combinatorial Theory, Series A41 An improved lower bound on the greatest element of a sum-distinct set of fixed order N.D.Elkies
  5. Monographies de L'Enseignement Mathematique 28 Old and vew probelms and results in combinatorial number theory P.Erdos;R.L.Graham
  6. Unsolved Problems in Intuitive Mathematics, Vol.Ⅰ, Number Theory R.K.Guy
  7. Annals of Discrete Mathematics v.12 Sets of integers whose subsets have distinct sums