Let A be an m\_n matrix in which the entries of each row are all distinct. A. A. Drisko (1998, J. Combin. Theory Ser. A 84, 181 195) showed that if m 2n&1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices with entries in the
A generalization of a result of Tran Van Trung on t-designs
✍ Scribed by Benoît Baudelet; Michel Sebille
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 411 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
We prove that if there exists a t -(v, k, λ) design satisfying the inequality
for some positive integer j (where m = min{j, v -k} and n = min{i, t}), then there exists a t -(v + j, k, λ( v-t+j j
)) design.
📜 SIMILAR VOLUMES
## Abstract A new lower bound on the size of ϵ‐almost strongly universal~2~ classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of ϵ − ASU~2~ classes of hash functions meeting the Stinson bound in terms of combinatorial designs. © 1994
defined the notion of t -designs in Q -polynomial association schemes and gave a Fisher type bound using linear programming . For each classical association scheme there is a
## Abstract The problem considered is polynomial regression and minimization of the variance of estimated slope maximized over all points in the region of interest when the design region and region of interest are hyperspheres with a common centre. Optimal designs under the criterion are derived fo