𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Avoiding-sequences with minimum sum

✍ Scribed by Dean S. Clark; James T. Lewis

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
360 KB
Volume
22
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sum-Avoiding Subsets
Sum-Avoiding Subsets
✍ Imre Z. Ruzsa πŸ“‚ Article πŸ“… 2005 πŸ› Springer US 🌐 English βš– 163 KB
Coloring of trees with minimum sum of co
Coloring of trees with minimum sum of colors
✍ Jiang, Tao; West, Douglas B. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 227 KB

The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree with strength k that has maximum degree only 2k -2. The result

The Density ofBh[g] Sequences and the Mi
The Density ofBh[g] Sequences and the Minimum of Dense Cosine Sums
✍ Mihail N. Kolountzakis πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 279 KB

A set E of integers is called a B h [ g] set if every integer can be written in at most g different ways as a sum of h elements of E. We give an upper bound for the size of a B h [1] subset [n 1 , ..., n k ] of [1, ..., n] whenever h=2m is an even integer: For the case h=2 (h=4) this has already be