𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost Disjoint Families of Representing Sets

✍ Scribed by Kevin P. Balanda


Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
474 KB
Volume
31
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Overlarge sets of disjoint Steiner quadr
✍ Luc Teirlinck πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

In this article, we construct overlarge sets of disjoint S(3, 4, 3 n -1) and overlarge sets of disjoint S(3, 4, 3 n + 1) for all n β‰₯ 2. Up to now, the only known infinite sequence of overlarge sets of disjoint S(3, 4, v) were the overlarge sets of disjoint S(3, 4, 2 n ) obtained from the oval conics

Cyclotomic constructions of external dif
✍ B. Huang; D. Wu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 98 KB

## Abstract External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. Some results had been obtained by Chang and Ding, the connection between EDFs and disjoint difference families (DDFs) was also established. In this paper, further cyclotomic constru

Blocking Sets of Almost RΓ©dei Type
✍ A. Blokhuis; R. Pellikaan; TamΓ‘s SzΕ‘nyi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 312 KB

We study minimal blocking sets in PG(2, q) having q+m points outside some fixed line. If 0<m<(-q)Γ‚2 then either the blocking set is large, or every line contains 1 mod p points of the blocking set, where p is the characteristic of the field GF(q). 1997 Academic Press 1. INTRODUCTION A blocking set i

Intersecting Balanced Families of Sets
✍ Adam Idzik; Gyula O.H. Katona; Rajiv Vohra πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 117 KB

Suppose that any t members (t 2) of a regular family on an n element set have at least k common elements. It is proved that the largest member of the family has at least k 1Γ‚t n 1&1Γ‚t elements. The same holds for balanced families, which is a generalization of the regularity. The estimate is asympto

Representing Powers of Numbers as Subset
✍ David Petrie Moulton πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 151 KB

We investigate a number of questions concerning representations of a set of numbers as sums of subsets of some other set. In particular, we obtain several results on the possible sizes of the second set when the first set consists of a geometric sequence of integers, partially answering a generalisa