Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Judith Q. Longyear"'
Autor:
Judith Q. Longyear
Publikováno v:
Encyclopedia of Statistical Sciences
Autor:
Judith Q. Longyear
Publikováno v:
Encyclopedia of Statistical Sciences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c195719bddefd6be6205e7c9c345420c
https://doi.org/10.1002/0471667196.ess2608
https://doi.org/10.1002/0471667196.ess2608
Autor:
Judith Q. Longyear, D. E. Kullman, Charles Jepsen, C. D. H. Cooper, R. P. Webber, Francine Abeles, J. D. E. Konhauser
Publikováno v:
The American Mathematical Monthly. 81:790-816
Autor:
Judith Q. Longyear
Publikováno v:
Journal of Statistical Planning and Inference. 13:81-87
The designs considered are nested in the sense of W.T. Federer, that is, each block of the larger design contains a smaller distinguished subblock and the set of subblocks also forms a design. One of the most useful constructions for obtaining new de
Autor:
Judith Q. Longyear
Publikováno v:
Annals of the New York Academy of Sciences. 319:354-361
Summary This paper is a part of the joint effort of N. Ito, J. Leon, and the author to determine the number of Hadamard matrices of order 24 which are inequivalent under transposition, row, or column permutation and row or column negation. The matric
Publikováno v:
Journal of Combinatorial Theory, Series A. 31:66-93
Recently the authors completed the classification of 3-(24, 12, 5) designs up to isomorphism. These designs are closely related to 24-dimensional Hadamard matrices, and the work on designs leads to a classification of the matrices up to equivalence.
Autor:
Judith Q. Longyear
Publikováno v:
Discrete Mathematics. 78(1-2):115-118
Let p = (a1,…,an,d) be a partition of n=a1(1)+a2(2)+⋯+an(n) with d=n+2-(a1+⋯+an) then 3n+3 n = ∑ p n+2 a 1 ,…,a n ,d prod; i=1 n (i+1) a i The proof of this formula involves using graphs to count the number of ways in which a permutation ca
Autor:
Judith Q. Longyear
Publikováno v:
Journal of Statistical Planning and Inference. 5:181-187
A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design. These designs are ‘nested’ in the sense of W.T. Federer (1972
Autor:
Judith Q. Longyear
Publikováno v:
Annals of the New York Academy of Sciences. 576:385-388
Autor:
Judith Q. Longyear
Publikováno v:
Journal of Combinatorial Theory, Series B. 21:91-95
Let A, B, C, D be latin squares with A orthogonal to B and C orthogonal to D. The pair A, B is isomorphic with the pair C, D if the graph of A, B is graph-isomorphic with the graph of C, D. A characterization is given for determining when a pair A, B