Upper bounds on the general covering numberCλ(v,k,t,m)
| Autor: | Riccardo Bertolo, Heikki Hämäläinen, Iliya Bluskov |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Combinatorics
010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Block (permutation group theory) Discrete Mathematics and Combinatorics 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Covering number 01 natural sciences Mathematics |
| Zdroj: | Journal of Combinatorial Designs. 12:362-380 |
| ISSN: | 1063-8539 |
| DOI: | 10.1002/jcd.20019 |
| Popis: | A collection 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 of with such that every block 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text