𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sums of lexicographically ordered sets

✍ Scribed by M.D. Atkinson; A. Negro; N. Santoro


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
458 KB
Volume
80
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Direct sums of ordered near-rings
✍ GΓΌnter F Pilz πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 153 KB
On subset sums of r-sets
✍ E. Lipkin πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 727 KB

Lipkin, E., On subset sums of r-sets, Discrete Mathematics 114 (1993) 3677377. A finite set of distinct integers is called an r-set if it contains at least r elements not divisible by 4 for each 4 > 2. Let f(n, r) denote the maximum cardinality of an r-set A c (1,2, , n} having no subset sum Caiai

Gauss Sums, Jacobi Sums, and p-Ranks of
✍ Ronald Evans; Henk D.L. Hollmann; Christian Krattenthaler; Qing Xiang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 301 KB

We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are (2 d &1, 2 d&1 &1, 2 d&2 &1) cyclic difference sets in the multiplicative group of the finite field F 2 d of 2 d elements, with d 2. We show that, except for a few