✦ LIBER ✦

Perfect addition sets

✍ Scribed by John R. Isbell

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 553 KB
Volume: 24
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90169-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The existence and nonexistence of perfec

The existence and nonexistence of perfect addition sets

✍ Clement W.H Lam; S.L Ma; M.K Siu 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 546 KB

Perfect difference sets constructed from

Perfect difference sets constructed from Sidon sets

✍ Javier Cilleruelo; Melvyn B. Nathanson 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 499 KB

Nearly perfect sets in graphs

✍ Jean E. Dunbar; Frederick C. Harris Jr; Sandra M. Hedetniemi; Stephen T. Hedetni 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 871 KB

In a graph G = (V, E), a set of vertices S is nearly perfect if every vertex in V-S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and efficient dominating sets. We say a nearly perfect set S is 1-minimal

Independent sets versus perfect matching

Independent sets versus perfect matchings

✍ Shang-Hua Teng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 618 KB

Iterated perfect-set forcing

✍ James E. Baumgartner; Richard Laver 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 613 KB

Perfect binary arrays and difference set

Perfect binary arrays and difference sets

✍ Jonathan Jedwab; Chris Mitchell; Fred Piper; Peter Wild 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 702 KB

A perfect binary array is an r-dimensional array with elements k 1 such that all out-of-phase periodic autocorrelation coefficients are zero. Such an array is equivalent to a Menon difference set in an abelian group. We give recursive constructions for four infinite families of two-dimensional perfe