Results 151 to 160 of about 4,321 (196)
Some of the next articles are maybe not open access.
New Constructions of BIB Designs
Biometrical Journal, 1985AbstractA method of construction of certain balanced incomplete block (BIB) designs is defined from which we get new series of BIB designs.
Kageyama, S., Mohan, R. N.
openaire +1 more source
On the BIB design having the minimum p-rank
Journal of Combinatorial Theory - Series A, 1975 AbstractIt is shown that (i) among BIB designs with parameters (2t+1 − 1, 2t+1 − 1, 2t − 1, 2t − 1, 2t−1 − 1), the incidence matrix of the BIB design PG(t, 2):t − 1 derived from a finite projective geometry PG(t, 2) has the minimum 2-rank and (ii) among BIB designs with parameters (2t, 2t+1 − 2, 2t − 1, 2−1, 2t−1 − 1), the incidence matrix of the BIB ...
N. Hamada, H. Ohmori
exaly +2 more sources
Estimation and hypothesis testing in BIB design and robustness
Computational Statistics and Data Analysis, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moti L Tiku, Birdal Senoglu
exaly +2 more sources
D-optimality of the dual of BIB designs
Statistics and Probability Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
BIB-Designs from Circular Nearrings
Results in Mathematics, 2012Let (\(N,\Phi\)) be a finite circular Ferrero pair. The set \(\Phi(a)+b\), \(a,b\in N\), \(a\not=0\), is visualized as a circle centered at \(b\) passing through \(a\). Then \(\mathcal D(a;b)=\{x\in\Phi(r)+c\mid r\not=0\), \(b\in \Phi(r)+c\), \(|(\Phi(r)+c)\cap(\Phi(a)+b)|=1\}\) can be visualized as the disk centered at \(b\) with its boundary circle ...
BENINI, ANNA +2 more
openaire +4 more sources
A new series of \(\mu\)-resolvable BIB designs [PDF]
広島大学大学院教育学研究科紀要. 第二部, 文化教育開発関連領域, 2002 Summary: A method of constructing a series of \(\mu\)-resolvable BIB designs from mutually orthogonal mates of BIB designs is provided. The resolvable designs obtainable through this method are new and involve lesser number of blocks for a fixed number of treatments than those obtained by \textit{S. Kageyama} and \textit{R. N. Mohan} [Discrete Math. 45,
Kageyama, Sanpei +2 more
openaire +3 more sources
Results on the support of BIB designs
Journal of Statistical Planning and Inference, 1989This paper presents further results on BIB designs with repeated blocks by the first author in collaboration with two new co-authors. Let \(BIB(v,b,r,k,\lambda)/b^*)\) denote a BIB (v,b,r,k,\(\lambda)\) design with precisely \(b^*\) distinct blocks. The set of all distinct blocks is called the support of the BIB design and the number \(b^*\) is called ...
Hedayat, A. S. +2 more
openaire +1 more source
Computational Statistics and Data Analysis, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ashish Das, Sanpei Kageyama
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ashish Das, Sanpei Kageyama
exaly +3 more sources
Acta Mathematica Sinica, English Series, 2000
The author improves his estimate [J. Comb. Des. 4, No. 2, 83-93 (1996; Zbl 0913.05017)] of the upper bound for the smallest integer \(c(k,\lambda)\) such that \(v\in B(k,\lambda)\) for every integer \(v\geq c(k,\lambda)\) that satisfies the congruences \(\lambda v(v- 1)\equiv 0\;(\text{mod }k(k- 1))\) and \(\lambda(v- 1)\equiv 0\;(\text{mod }k- 1)\) in
openaire +1 more source
The author improves his estimate [J. Comb. Des. 4, No. 2, 83-93 (1996; Zbl 0913.05017)] of the upper bound for the smallest integer \(c(k,\lambda)\) such that \(v\in B(k,\lambda)\) for every integer \(v\geq c(k,\lambda)\) that satisfies the congruences \(\lambda v(v- 1)\equiv 0\;(\text{mod }k(k- 1))\) and \(\lambda(v- 1)\equiv 0\;(\text{mod }k- 1)\) in
openaire +1 more source
BIB(8, 56, 21, 3, 6) and BIB(10, 30, 9, 3, 2) designs with repeated blocks
Journal of Combinatorial Theory - Series A, 1984 AbstractIf there are less than b distinct blocks in a BIB design with b blocks then we say the design has repeated blocks. The set of distinct blocks of a design is called the support of the design. BIB designs with repeated blocks, besides being optimal, have special applications in the design of experiments and controlled samplings.
A Hedayat
exaly +3 more sources