Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Dale M. Mesner"'
Publikováno v:
Journal of Statistical Planning and Inference. 56:257-268
In this paper we present two generalizations of the results on the intersection numbers of t-designs: the first is related to a result of Ray-Chaudhuri and Wilson (Osaka J. Math. 12 (1975) 737–744) and the second to that of Mendelsohn (in: Studies
Autor:
Dale M. Mesner, Earl S. Kramer, Stephen Mellendorf, Richard A. Brualdi, Peter Horak, Geňa Hahn
Publikováno v:
Journal of Combinatorial Theory, Series A. 69:333-346
In 1977, Ganter and Teirlinck proved that any 2 t × 2 t matrix with 2 t nonzero elements can be partitioned into four submatrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any mt × nt matr
Autor:
Dale M. Mesner, Earl S. Kramer
Publikováno v:
Discrete Mathematics. 15(3):263-296
A t-design T=(X, B), denoted by (λ; t, k, v), is a system B of subsets of size k from a v-set X, such that each t-subset of X is contained in exactly λ elements of B. A hypergraph H=(Y, E) is a finite set Y where E=(Ei: iϵI) is a family of subsets
Autor:
Earl S. Kramer, Dale M. Mesner
Publikováno v:
Journal of Combinatorial Theory, Series A. 16(3):273-285
A Steiner system S(l, m, n) is a system of subsets of size m (called blocks) from an n-set S, such that each d-subset from S is contained in precisely one block. Two Steiner systems have intersection k if they share exactly k blocks. The possible int
Autor:
Raj Chandra Bose, Dale M. Mesner
Publikováno v:
Ann. Math. Statist. 30, no. 1 (1959), 21-38
Autor:
Dale M. Mesner
Publikováno v:
Canadian Journal of Mathematics. 16:82-93
If A = (aij) is a matrix whose elements are 0's and l's, more briefly a (0, l)-matrix, the trace of A, defined as the sum of the diagonal elements aii and denoted by Tr A, is the number of l's on the main diagonal. Matrices which can be obtained from
Autor:
Dale M. Mesner
Publikováno v:
Canadian Journal of Mathematics. 19:273-280
Let ∑ be a projective space PG(3, q) of dimension 3 and finite order q. Then ∑ contains (q + 1)(q2 + 1) points and an equal number of planes, and (q2 + 1) (q2 + q + 1) lines. It will be convenient to consider lines and planes as sets of points an
Autor:
Dale M. Mesner
Publikováno v:
Ann. Math. Statist. 36, no. 1 (1965), 331-336
Publikováno v:
Discrete Mathematics. (2):171-189
A t-design (X, @?) is a @u-set X together with a family @? of k-subsets from X, called blocks, such that each subset of X of size t is contained in exactly @l members of @?. A t-design with the above parameters is also called a t-(@u, k, @l) design.
Autor:
Earl S. Kramer, Dale M. Mesner
Publikováno v:
Discrete Mathematics. (1):123-131
Karl Byleen and Dale Mesner have suggested the following natural generalization of Room squares: An r-dimensional Steiner tableau of side n is an array (a"i"""1i"2...i"r) of n^r cells where each cell is either empty or contains an unordered r-tuple f