✍ Scribed by Riccardo Bertolo; Iliya Bluskov; Heikki Hämäläinen
No coin nor oath required. For personal study only.
A collection $\cal C$ of k‐subsets (called blocks) of a v‐set X (v) = {1, 2,…, v} (with elements called points) is called a t‐(v, k, m, λ) covering if for every m‐subset M of X (v) there is a subcollection $\cal K$ of $\cal C$ with $|\cal K|\geq \lambda$ such that every block K ∈ $\cal K$ has at least t points in common with M. It is required that v ≥ k ≥ t and v ≥ m ≥ t. The minimum number of blocks in a t‐(v, k, m, λ) covering is denoted by C~λ~(v, k, t, m). We present some constructions producing the best known upper bounds on C~λ~(v, k, t, m) for k = 6, a parameter of interest to lottery players. © 2004 Wiley Periodicals, Inc.
📜 SIMILAR VOLUMES
## Abstract Howlers (genus __Alouatta__) are widely captured with the use of anesthetic projectiles; however, no capture protocol involving the use of traps has been described to date. In the present study we describe the first efficient capture program for black and gold howlers (__Alouatta caraya
## Abstract The aim of this study was to investigate the dissociation patterns, and in particular the relative abundance of [b~3~ + 17 + Cat]^+^, for peptides with C‐termini designed to allow transfer of the —OH required to generate the product ion, but not necessarily as the most favored pathway.