Results 41 to 50 of about 4,555 (128)
Tournament Design in Doubles Pickleball
International Journal of Racket Sports ScienceThis paper considers a common tournament design in doubles pickleball where N players compete across n matches. The research question involves the assignment of partners and opponents over the n matches.
Tim Swartz, Boxin Tang
doaj +1 more source
Balanced incomplete block designs with block size 9: part II
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abel, R.Julian R. +2 more
openaire +3 more sources
Some balanced incomplete block designs
Computers & Mathematics with Applications, 2000 New solutions for symmetric BIBDs with parameters \((45, 12, 3)\), \((36, 15, 6)\) and \((40, 13, 4)\) are described.
openaire +1 more source
A ring partition construction for bibds
Revista Técnica de la Facultad de IngenierÃa, 2011 A method for finding initial difference blocks for certain balanced incomplete block designs by means of partitions of elements in finite rings is given. It is shown that multiplier theory for difference sets, when expressed.
R. C. Mullin
doaj
Partially Balanced Incomplete Block Designs
, 1969 In balanced incomplete block designs, each pair of treatments is compared with equal precision, and each treatment is paired with every other treatment an equal number of times with in a common block; A is a constant for all treatments. There is one associate class for each treatment in balanced incomplete block designs.
openaire +3 more sources
An Inequality for Balanced Incomplete Block Designs
The Annals of Mathematical Statistics, 1961 For a resolvable balanced incomplete block design, R. C. Bose [1] obtained the inequality $b \geqq v + r - 1$, and P. M. Roy [2] and W. F. Mikhail [3] proved this inequality without the assumption of resolvability, but with the weaker assumption that $v$ is a multiple of $k$. In this note an alternative and simpler proof of Roy's theorem is given.
openaire +2 more sources
An Inequality for Balanced Incomplete Block Designs
The Annals of Mathematical Statistics, 1960 The inequality $b \geqq v + r - 1$ for a balanced incomplete block design was proved by Bose [1] under the assumption of resolvability. In this note the inequality is proved without that assumption, but with the weaker assumption that $v = nk$.
openaire +2 more sources
A Note on Balanced Incomplete Block Designs
The Annals of Mathematical Statistics, 1969 Summary: The author studies balanced incomplete block designs (BIBD) in which the blocks are not necessarily distinct. He proves the following Theorem. Let \(\mathcal D\) be a BIBD with parameters \(v,b,r,k,\lambda\). If \(s\) blocks of \(\mathcal D\) are identical and if \(r>\lambda\), then \(r/k=b/v\ge s\). The theorem implies the results of E.
openaire +2 more sources
Construction of Rotatable Designs Through Balanced Incomplete Block Designs
The Annals of Mathematical Statistics, 1962 Rotatable designs were introduced by Box and Hunter (1954, 1957) for the exploration of response surfaces. They constructed these designs through geometrical configurations and obtained several second order designs. Afterwards, Gardiner and others (1959) obtained some third order designs through the same technique for two and three factors and a third ...
Das, M. N., Narasimham, V. L.
openaire +2 more sources
Balanced Incomplete Block Designs and Tactical Configurations
The Annals of Mathematical Statistics, 1955 A balanced incomplete block design (BIB design) is an arrangement of $v$ varieties of treatments in $b$ blocks of $k$ distinct varieties each, so that each variety is contained in $r$ blocks and every pair of varieties is contained in $\lambda$ blocks. Various methods of constructing such designs are discussed in [2], and certain designs are listed in [
openaire +3 more sources