~roughout this paper we use the following notatians: The cardinality of the finite set Y is denoted by ISI -.s& B8, . I s den&e finite or infinite sets of positive integers. If & is a finite or infinite set of positive integers, then S(d) denotes the set of the distinct positive integers n that can
Subset sums in binary spaces
✍ Scribed by Gilles Ze´mor
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 599 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Freiman, G.A., New analytical results in subset-sum problem, Discrete Mathematics 114 (1993) 205-218. An analytical method is developed to prove that, for the integer set k[l, I]. with I>/, and jAl=m>c,1"\*(log/) ) "2 the set A\* of subset sums contains a long arithmetic progression of length larger
In this paper, we consider the problem of expressing a term of a given nondegenerate binary recurrence sequence as a sum of factorials. We show that if one bounds the number of factorials allowed, then there are only finitely many effectively computable terms which can be represented in this way. As
## Abstract We study the role that the axiom of choice plays in Tychonoff's product theorem restricted to countable families of compact, as well as, Lindelöf metric spaces, and in disjoint topological unions of countably many such spaces. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)