✦ LIBER ✦

On Optimal Subset Representations of Integer Sets

✍ Scribed by Mike Develin

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 121 KB
Volume: 89
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.2000.2647

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we investigate representations of sets of integers as subset sums of other sets of minimal size, achieving results on the nature of the representing set as well as providing several reformulations of the problem. We apply one of these reformulations to prove a conjecture and extend a theorem of David Moulton concerning the case when the set to be represented consists of a geometric sequence. Finally, we provide a number of interesting questions for possible future research in this relatively new area.

📜 SIMILAR VOLUMES

Kolmogorov complexity and set theoretica

Kolmogorov complexity and set theoretical representations of integers

✍ Marie Ferbus-Zanda; Serge Grigorieff 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB

## Abstract We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivi

On Representations of Integers by Indefi

On Representations of Integers by Indefinite Ternary Quadratic Forms

✍ Mikhail Borovoi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Let f be an indefinite ternary integral quadratic form and let q be a nonzero integer such that &q det( f ) is not a square. Let N(T, f, q) denote the number of integral solutions of the equation f (x)=q where x lies in the ball of radius T centered at the origin. We are interested in the asymptotic

On set intersection representations of g

On set intersection representations of graphs

✍ Stasys Jukna 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 1 views

## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~⊆{1, …, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only

On the Representation of Integers by the

On the Representation of Integers by the Lorentzian Quadratic Form

✍ John G. Ratcliffe; Steven T. Tschantz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 413 KB

In this paper, we establish an asymptotic formula, for large radius r, for the number of representations of a nonzero integer k by the Lorentzian quadratic form x 2 1 +x 2 2 + } } } +x 2 n &x 2 n+1 that are contained in the ball of radius r centered at the origin in Euclidean (n+1)-space. 1997 Acade

On the Counting Function of Primitive Se

On the Counting Function of Primitive Sets of Integers

✍ Rudolf Ahlswede; Levon H Khachatrian; András Sárközy 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Tiling the Integers with Translates of O

Tiling the Integers with Translates of One Finite Set

✍ Ethan M. Coven; Aaron Meyerowitz 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 115 KB

A set tiles the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For sets of prime power Ž . size, it was solved by D. Newman 1977, J. Numbe