|
|
| Line 1: |
Line 1: |
| {{about|block designs with fixed block size (uniform)|block designs with variable block sizes|Combinatorial design|[[design of experiments|experimental design]]s in [[statistics]]|randomized block design}}
| | Oscar is how he's called and he totally enjoys this name. Hiring is my profession. Puerto Rico is exactly where he's been living for years and he will by no means move. To perform baseball is the hobby he will by no means quit doing.<br><br>my web blog ... std home test ([http://www.terradaamare.it/terra/members/jewdarre/activity/49851/ please click the next website]) |
| | |
| In [[combinatorics|combinatorial]] [[mathematics]], a '''block design''' is a set together with a [[Family of sets|family of subsets]] (repeated subsets are allowed at times) whose members are chosen to satisfy some set of properties that are deemed useful for a particular application. These applications come from many areas, including [[experimental design]], [[finite geometry]], [[software testing]], [[cryptography]], and [[algebraic geometry]]. Many variations have been examined, but the most intensely studied are the '''balanced incomplete block designs''' (BIBDs or 2-designs) which historically were related to statistical issues in the [[design of experiments]].<ref>{{harvnb|Colbourn|Dinitz|2007}}</ref><ref>{{harvnb|Stinson|2003|loc=pg.1}}</ref>
| |
| | |
| A block design in which all the blocks have the same size is called ''uniform''. The designs discussed in this article are all uniform. [[Combinatorial design#pairwise balanced design|Pairwise balanced designs (PBDs)]] are examples of block designs that are not necessarily uniform.
| |
| | |
| ==Definition of a BIBD (or 2-design)==
| |
| | |
| Given a finite set ''X'' (of elements called points) and integers ''k'', ''r'', ''λ'' ≥ 1, we define a ''2-design'' (or ''BIBD'', standing for balanced incomplete block design) ''B'' to be a family of ''k''-element subsets of ''X'', called ''blocks'', such that the number ''r'' of blocks containing ''x'' in ''X'' is not dependent on which ''x'' is chosen, and the number ''λ'' of blocks containing given distinct points ''x'' and ''y'' in ''X'' is also independent of the choices.
| |
| | |
| "Family" in the above definition can be replaced by "set" if repeated blocks are not allowed. Designs in which repeated blocks are not allowed are called ''simple''.
| |
| | |
| Here ''v'' (the number of elements of ''X'', called points), ''b'' (the number of blocks), ''k'', ''r'', and λ are the ''parameters'' of the design. (To avoid degenerate examples, it is also assumed that ''v'' > ''k'', so that no block contains all the elements of the set. This is the meaning of "incomplete" in the name of these designs.) In a table:
| |
| :{| class="wikitable"
| |
| | ''v'' || points, number of elements of ''X''
| |
| |-
| |
| | ''b'' || blocks
| |
| |-
| |
| | ''r'' || number of blocks containing a given point
| |
| |-
| |
| | ''k'' || number of points in a block
| |
| |-
| |
| | ''λ'' || number of blocks containing 2 (or more generally ''t'') points
| |
| |-
| |
| |}
| |
| | |
| The design is called a (''v'', ''k'', ''λ'')-design or a (''v'', ''b'', ''r'', ''k'', ''λ'')-design. The parameters are not all independent; ''v'', ''k'', and λ determine ''b'' and ''r'', and not all combinations of ''v'', ''k'', and ''λ'' are possible. The two basic equations connecting these parameters are
| |
| | |
| :<math> bk = vr, \,</math>
| |
| | |
| :<math> \lambda(v-1) = r(k-1). \,</math>
| |
| | |
| These conditions are not sufficient as, for example, a (43,7,1)-design does not exist.<ref>Proved by Tarry in 1900 who showed that there was no pair of orthogonal [[Latin square]]s of order six. The 2-design with the indicate parameters is equivalent to the existence of five mutually orthogonal Latin squares of order six.</ref>
| |
| | |
| The ''order'' of a 2-design is defined to be ''n'' = ''r'' − ''λ''. The '''complement''' of a 2-design is obtained by replacing each block with its complement in the point set ''X''. It is also a 2-design and has parameters ''v''′ = ''v'', ''b''′ = ''b'', ''r''′ = ''b''−''r'', ''k''′ = ''v''−''k'', ''λ''′ = ''λ''+''b''−2''r''. A 2-design and its complement have the same order.
| |
| | |
| A fundamental theorem, [[Fisher's inequality]], named after the statistician [[Ronald Fisher]], is that ''b'' ≥ ''v'' in any 2-design.
| |
| | |
| ==Symmetric BIBDs==
| |
| | |
| The case of equality in Fisher's inequality, that is, a 2-design with an equal number of points and blocks, is called a '''symmetric design'''.<ref>They have also been referred to as ''projective designs'' or ''square designs''. These alternatives have been used in an attempt to replace the term "symmetric", since there is nothing symmetric (in the usual meaning of the term) about these designs. The use of ''projective'' is due to P.Dembowski (''Finite Geometries'', Springer, 1968), in analogy with the most common example, projective planes, while ''square'' is due to P. Cameron (''Designs, Graphs, Codes and their Links'', Cambridge, 1991) and captures the implication of v = b on the incidence matrix. Neither term has caught on as a replacement and these designs are still universally referred to as ''symmetric''.</ref> Symmetric designs have the smallest number of blocks amongst all the 2-designs with the same number of points.
| |
| | |
| In a symmetric design ''r'' = ''k'' holds as well as ''b'' = ''v'', and, while it is generally not true in arbitrary 2-designs, in a symmetric design every two distinct blocks meet in ''λ'' points.<ref>{{harvnb|Stinson|2003|loc=pg.23, Theorem 2.2}}</ref> A theorem of [[Herbert Ryser|Ryser]] provides the converse. If ''X'' is a ''v''-element set, and ''B'' is a ''v''-element set of ''k''-element subsets (the "blocks"), such that any two distinct blocks have exactly λ points in common, then (''X, B'') is a symmetric block design.<ref>{{harvnb|Ryser|1963|loc = pp. 102-104}}</ref>
| |
| | |
| The parameters of a symmetric design satisfy
| |
| ::<math> \lambda (v-1) = k(k-1). </math>
| |
| This imposes strong restrictions on ''v'', so the number of points is far from arbitrary. The [[Bruck–Ryser–Chowla theorem]] gives necessary, but not sufficient, conditions for the existence of a symmetric design in terms of these parameters.
| |
| | |
| The following are important examples of symmetric 2-designs:
| |
| | |
| ===Projective planes===
| |
| {{main|Projective plane}}
| |
| | |
| [[Projective plane#Finite projective planes|Finite projective planes]] are symmetric 2-designs with ''λ'' = 1 and order ''n'' > 1. For these designs the symmetric design equation becomes:
| |
| | |
| ::<math>v-1 = k(k-1).\,</math>
| |
| | |
| Since ''k'' = ''r'' we can write the ''order of a projective plane'' as ''n'' = ''k'' − 1 and, from the displayed equation above, we obtain ''v'' = (''n'' + 1)''n'' + 1 = ''n''<sup>2</sup> + ''n'' + 1 points in a projective plane of order ''n''.
| |
| | |
| As a projective plane is a symmetric design, we have ''b'' = ''v'', meaning that ''b'' = ''n''<sup>2</sup> + ''n'' + 1 also. The number ''b'' is the number of ''lines'' of the projective plane. There can be no repeated lines since λ = 1, so a projective plane is a simple 2-design in which the number of lines and the number of points are always the same. For a projective plane, ''k'' is the number of points on each line and it is equal to ''n'' + 1. Similarly, ''r'' = ''n'' + 1 is the number of lines with which a given point is incident.
| |
| | |
| For ''n'' = 2 we get a projective plane of order 2, also called the [[Fano plane]], with ''v'' = 4 + 2 + 1 = 7 points and 7 lines. In the Fano plane, each line has ''n'' + 1 = 3 points and each point belongs to ''n'' + 1 = 3 lines.
| |
| | |
| Projective planes are known to exist for all orders which are prime numbers or powers of primes. They form the only known infinite family (with respect to having a constant λ value) of symmetric block designs.<ref name="Hughes 1985 loc=pg.109">{{harvnb|Hughes|Piper|1985|loc=pg.109}}</ref>
| |
| | |
| ===Biplanes===
| |
| A '''biplane''' or '''biplane geometry''' is a symmetric 2-design with ''λ'' = 2; that is, every set of two points is contained in two blocks ("lines"), while any two lines intersect in two points.<ref name="Hughes 1985 loc=pg.109">{{harvnb|Hughes|Piper|1985|loc=pg.109}}</ref> They are similar to finite projective planes, except that rather than two points determining one line (and two lines determining one point), two points determine two lines (respectively, points). A biplane of order ''n'' is one whose blocks have ''k'' = ''n'' + 2 points; it has ''v'' = 1 + (''n'' + 2)(''n'' + 1)/2 points (since ''r'' = ''k'').
| |
| | |
| The 18 known examples<ref>{{harvnb|Hall|1986|loc=pp.320-335}}</ref> are listed below.
| |
| * (Trivial) The order 0 biplane has 2 points (and lines of size 2; a 2-(2,2,2) design); it is two points, with two blocks, each consisting of both points. Geometrically, it is the [[digon]].
| |
| * The order 1 biplane has 4 points (and lines of size 3; a 2-(4,3,2) design); it is the complete design with ''v'' = 4 and ''k'' = 3. Geometrically, the points are the vertices and the blocks are the faces of a tetrahedron.
| |
| * The order 2 biplane is the complement of the [[Fano plane]]: it has 7 points (and lines of size 4; a 2-(7,4,2)), where the lines are given as the ''complements'' of the (3-point) lines in the Fano plane.<ref>{{harvnb|Assmus|Key|1992|loc=pg.55}}</ref>
| |
| * The order 3 biplane has 11 points (and lines of size 5; a 2-(11,5,2)), and is also known as the '''{{visible anchor|Paley biplane}}''' after [[Raymond Paley]]; it is associated to the [[Paley digraph]] of order 11, which is constructed using the field with 11 elements, and is the [[#Hadamard 2-designs|Hadamard 2-design]] associated to the size 12 Hadamard matrix; see [[Paley construction#Paley construction I|Paley construction I]].
| |
| :Algebraically this corresponds to the exceptional embedding of the [[projective special linear group]] ''PSL''(2,5) in ''PSL''(2,11) – see [[Projective linear group#Action on p points|projective linear group: action on ''p'' points]] for details.<ref name="martinsingerman">{{citation | title = From Biplanes to the Klein quartic and the Buckyball | first1 = Pablo | last1 = Martin | first2 = David | last2 = Singerman | date = April 17, 2008 | url = http://www.neverendingbooks.org/DATA/biplanesingerman.pdf | page = 4}}</ref>
| |
| * There are three biplanes of order 4 (and 16 points, lines of size 6; a 2-(16,6,2)). These three designs are also [[Regular Hadamard matrix|Menon designs]].
| |
| * There are four biplanes of order 7 (and 37 points, lines of size 9; a 2-(37,9,2)).<ref>{{harvnb|Salwach|Mezzaroba|1978}}</ref>
| |
| * There are five biplanes of order 9 (and 56 points, lines of size 11; a 2-(56,11,2)).<ref>{{harvnb|Kaski|Östergård|2008}}</ref>
| |
| * Two biplanes are known of order 11 (and 79 points, lines of size 13; a 2-(79,13,2)).<ref>{{harvnb|Aschbacher|1971|loc=pp. 279–281}}</ref>
| |
| | |
| ===Hadamard 2-designs===
| |
| An [[Hadamard matrix]] of size ''m'' is an ''m'' × ''m'' matrix '''H''' whose entries are ±1 such that '''HH'''<sup>⊤</sup> = m'''I'''<sub>m</sub>, where '''H'''<sup>⊤</sup> is the transpose of '''H''' and '''I'''<sub>m</sub> is the ''m'' × ''m'' identity matrix. An Hadamard matrix can be put into ''standardized form'' (that is, converted to an equivalent Hadamard matrix) where the first row and first column entries are all +1. If the size ''m'' > 2 then ''m'' must be a multiple of 4.
| |
| | |
| Given an Hadamard matrix of size 4''a'' in standardized form, remove the first row and first column and convert every -1 to a 0. The resulting 0-1 matrix '''M''' is the [[incidence matrix]] of a symmetric 2-(4''a''-1, 2''a''-1, ''a''-1) design called an '''Hadamard 2-design'''.<ref>{{harvnb|Stinson|2003|loc=pg. 74, Theorem 4.5}}</ref> This construction is reversible, and the incidence matrix of a symmetric 2-design with these parameters can be used to form an Hadamard matrix of size 4''a''.
| |
| | |
| ==Resolvable 2-designs==
| |
| A '''resolvable 2-design''' is a BIBD whose blocks can be partitioned into sets (called ''parallel classes''), each of which forms a partition of the point set of the BIBD. The set of parallel classes is called a ''resolution'' of the design.
| |
| | |
| If a 2-(''v'',''k'',λ) resolvable design has ''c'' parallel classes, then ''b'' ≥ ''v'' + ''c'' - 1.<ref>{{harvnb|Hughes|Piper|1985|loc=pg. 156, Theorem 5.4}}</ref>
| |
| | |
| Consequently, a symmetric design can not have a non-trivial (more than one parallel class) resolution.<ref>{{harvnb|Hughes|Piper|1985|loc=pg. 158, Corollary 5.5}}</ref>
| |
| | |
| Archetypical resolvable 2-designs are the finite [[projective plane#Affine planes|affine planes]]. A solution of the famous [[15 schoolgirl problem]] is a resolution of a 2-(15,3,1) design.<ref>{{harvnb|Beth|Jungnickel|Lenz|1986|loc=pg. 40 Example 5.8}}</ref>
| |
| | |
| ==Generalization: ''t''-designs==
| |
| Given any positive integer ''t'', a ''t''-design ''B'' is a class of ''k''-element subsets of ''X'', called ''blocks'', such that every point ''x'' in ''X'' appears in exactly ''r'' blocks, and every ''t''-element subset ''T'' appears in exactly λ blocks. The numbers ''v'' (the number of elements of ''X''), ''b'' (the number of blocks), ''k'', ''r'', λ, and ''t'' are the ''parameters'' of the design. The design may be called a ''t''-(''v'',''k'',λ)-design. Again, these four numbers determine ''b'' and ''r'' and the four numbers themselves cannot be chosen arbitrarily. The equations are
| |
| | |
| :<math> \lambda_i = \lambda \left.\binom{v-i}{t-i} \right/ \binom{k-i}{t-i} \text{ for } i = 0,1,\ldots,t, </math>
| |
| | |
| where ''λ<sub>i</sub>'' is the number of blocks that contain any ''i''-element set of points. | |
| | |
| '''Theorem''':<ref>{{harvnb|Stinson|2003|loc=pg.203, Corollary 9.6}}</ref> Any ''t''-(''v'',''k'',λ)-design is also an ''s''-(''v'',''k'',λ<sub>s</sub>)-design for any ''s'' with 1 ≤ ''s'' ≤ ''t''. (Note that the "lambda value" changes as above and depends on ''s''.)
| |
| | |
| A consequence of this theorem is that every ''t''-design with ''t'' ≥ 2 is also a 2-design.
| |
| | |
| There are no known examples of non-trivial ''t''-(''v'',''k'',1)-designs with <math>t > 5</math>.
| |
| | |
| The term ''block design'' by itself usually means a 2-design.
| |
| | |
| ===Derived and extendable t-designs===
| |
| Let '''D''' = (''X'', ''B'') be a t-(''v'',''k'',''λ'') design and ''p'' a point of ''X''. The ''derived design'' ''D''<sub>''p''</sub> has point set ''X'' − {''p''} and as block set all the blocks of '''D''' which contain p with p removed. It is a (''t'' − 1)-(''v'' − 1, ''k'' − 1, ''λ'') design. Note that derived designs with respect to different points may not be isomorphic. A design '''E''' is called an ''extension'' of '''D''' if '''E''' has a point p such that '''E'''<sub>p</sub> is isomorphic to '''D'''; we call '''D''' ''extendable'' if it has an extension.
| |
| | |
| '''Theorem''':<ref>{{harvnb|Hughes|Piper|1985|loc=pg.29}}</ref> If a ''t''-(''v'',''k'',''λ'') design has an extension, then ''k'' + 1 divides ''b''(''v'' + 1).
| |
| | |
| The only extendable [[projective plane]]s (symmetric 2-(''n''<sup>2</sup> + ''n'' + 1, ''n'' + 1, 1) designs) are those of orders 2 and 4.<ref>{{harvnb|Cameron|van Lint|1991|loc=pg. 11, Proposition 1.34}}</ref>
| |
| | |
| Every Hadamard 2-design is extendable (to an '''Hadamard 3-design''').<ref>{{harvnb|Hughes|Piper|1985|loc=pg. 132, Theorem 4.5}}</ref>
| |
| | |
| '''Theorem''':.<ref>{{harvnb|Cameron|van Lint|1991|loc=pg. 11, Theorem 1.35}}</ref>
| |
| If '''D''', a symmetric 2-(''v'',''k'',λ) design, is extendable, then one of the following holds:
| |
| # '''D''' is an Hadamard 2-design,
| |
| # ''v'' = (λ + 2)(λ<sup>2</sup> + 4λ + 2), ''k'' = λ<sup>2</sup> + 3λ + 1,
| |
| # ''v'' = 495, ''k'' = 39, λ = 3.
| |
| | |
| Note that the projective plane of order two is an Hadamard 2-design; the projective plane of order four has parameters which fall in case 2; the only other known symmetric 2-designs with parameters in case 2 are the order 9 biplanes, but none of them are extendable; and there is no known symmetric 2-design with the parameters of case 3.<ref>{{harvnb|Colbourn|Dinitz|2007|loc=pg. 114, Remarks 6.35}}</ref>
| |
| | |
| ====Inversive planes====
| |
| A design with the parameters of the extension of an [[affine plane (incidence geometry)#Finite affine plane|affine plane]], i.e., a 3-(''n''<sup>2</sup> + 1, ''n'' + 1, 1) design, is called a finite '''inversive plane''', or [[Möbius plane]], of order ''n''.
| |
| | |
| It is possible to give a geometric description of some inversive planes, indeed, of all known inversive planes. An ''[[Ovoid (projective geometry)|ovoid]]'' in PG(3,''q'') is a set of ''q''<sup>2</sup> + 1 points, no three collinear. It can be shown that every plane (which is a hyperplane since the geometric dimension is 3) of PG(3,''q'') meets an ovoid ''O'' in either 1 or ''q'' + 1 points. The plane sections of size ''q'' + 1 of ''O'' are the blocks of an inversive plane of order ''q''. Any inversive plane arising this way is called ''egglike''. All known inversive planes are egglike.
| |
| | |
| An example of an ovoid is the [[Quadric (projective geometry)|elliptic quadric]], the set of zeros of the quadratic form
| |
| ::: ''x''<sub>1</sub>''x''<sub>2</sub> + ''f''(''x''<sub>3</sub>, ''x''<sub>4</sub>),
| |
| where f is an irreducible [[quadratic form]] in two variables over GF(''q''). [''f''(''x'',''y'') = ''x''<sup>2</sup> + ''xy'' + ''y''<sup>2</sup> for example].
| |
| | |
| If ''q'' is an odd power of 2, another type of ovoid is known – the [[Ovoid (projective geometry)|Suzuki-Tits ovoid]].
| |
| | |
| '''Theorem'''. Let ''q'' be a positive integer, at least 2. (a) If ''q'' is odd, then any ovoid is projectively equivalent to the elliptic quadric in a projective geometry PG(3,''q''); so ''q'' is a prime power and there is a unique egglike inversive plane of order ''q''. (But it is unknown if non-egglike ones exist.) (b) if ''q'' is even, then ''q'' is a power of 2 and any inversive plane of order ''q'' is egglike (but there may be some unknown ovoids).
| |
| | |
| ==Steiner systems==
| |
| {{main|Steiner system}}
| |
| | |
| A '''[[Steiner system]]''' (named after [[Jakob Steiner]]) is a t-design with λ = 1 and ''t'' ≥ 2.
| |
| | |
| A Steiner system with parameters ''t'', ''k'', ''n'', written S(''t'',''k'',''n''), is an ''n''-element [[Set (mathematics)|set]] ''S'' together with a set of ''k''-element [[subset]]s of ''S'' (called '''blocks''') with the property that each ''t''-element subset of ''S'' is contained in exactly one block. In the general notation for block designs, an S(''t'',''k'',''n'') would be a ''t''-(''n'',''k'',1) design.
| |
| | |
| This definition is relatively modern, generalizing the ''classical'' definition of Steiner systems which in addition required that ''k'' = ''t'' + 1. An S(2,3,''n'') was (and still is) called a ''Steiner triple system'', while an S(3,4,''n'') was called a ''Steiner quadruple system'', and so on. With the generalization of the definition, this naming system is no longer strictly adhered to.
| |
| | |
| [[Projective plane]]s and [[Affine plane (incidence geometry)|affine planes]] are examples of Steiner systems under the current definition while only the [[Fano plane]] (projective plane of order 2) would have been a Steiner system under the older definition.
| |
| | |
| ==Partially balanced designs (PBIBDs)==
| |
| | |
| An ''n''-class [[association scheme]] consists of a [[Set (mathematics)|set]] ''X'' of size ''v'' together with a [[partition of a set|partition]] ''S'' of ''X'' × ''X'' into ''n'' + 1 [[binary relation]]s, R<sub>0</sub>, R<sub>1</sub>, ..., R<sub>n</sub>. A pair of elements in relation R<sub>i</sub> are said to be ''i''<sup>th</sup>–''associates''. Each element of ''X'' has ''n''<sub>i</sub> ''i''<sup>th</sup> associates. Furthermore:
| |
| | |
| *<math>R_{0}=\{(x,x):x\in X\}</math> and is called the [[Identity relation]].
| |
| *Defining <math> R^* :=\{(x,y) | (y,x)\in R\}</math>, if ''R'' in ''S'', then ''R*'' in ''S''
| |
| *If <math>(x,y)\in R_{k}</math>, the number of <math>z\in X</math> such that <math>(x,z)\in R_{i}</math> and <math>(z,y)\in R_{j}</math> is a constant <math>p^k_{ij}</math> depending on ''i'', ''j'', ''k'' but not on the particular choice of ''x'' and ''y''.
| |
| | |
| An association scheme is ''commutative'' if <math>p_{ij}^k=p_{ji}^k</math> for all ''i'', ''j'' and ''k''. Most authors assume this property.
| |
| | |
| A '''partially balanced incomplete block design''' with ''n'' associate classes (PBIBD(''n'')) is a block design based on a ''v''-set X with ''b'' blocks each of size ''k'' and with each element appearing in ''r'' blocks, such that there is an association scheme with ''n'' classes defined on ''X'' where, if elements ''x'' and ''y'' are ''i''<sup>th</sup> associates, 1 ≤ ''i'' ≤ ''n'', then they are together in precisely λ<sub>i</sub> blocks.
| |
| | |
| A PBIBD(''n'') determines an association scheme but the converse is false.<ref>{{harvnb|Street|Street|1987|loc=pg. 237}}</ref>
| |
| | |
| ===Example ===
| |
| Let ''A''(3) be the following association scheme with three associate classes on the set ''X'' = {1,2,3,4,5,6}. The (''i'',''j'') entry is ''s'' if elements ''i'' and ''j'' are in relation R<sub>s</sub>.
| |
| <center>
| |
| {| class="wikitable"
| |
| |-
| |
| ! !! 1!! 2!! 3!! 4!! 5!! 6
| |
| |-
| |
| | '''1''' || <span style="color:white; background:blue"> 0 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:lime"> 2 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:fuchsia"> 3 </span>
| |
| |-
| |
| |'''2'''|| <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:blue"> 0 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:lime"> 2 </span> || <span style="color:white; background:fuchsia"> 3 </span>
| |
| |-
| |
| | '''3''' || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:blue"> 0 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:lime"> 2 </span>
| |
| |-
| |
| | '''4''' || <span style="color:white; background:lime"> 2 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:blue"> 0 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:red"> 1 </span>
| |
| |-
| |
| | '''5''' || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:lime"> 2 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:blue"> 0 </span> || <span style="color:white; background:red"> 1 </span>
| |
| |-
| |
| | '''6''' || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:fuchsia"> 3 </span> || <span style="color:white; background:lime"> 2 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:red"> 1 </span> || <span style="color:white; background:blue"> 0 </span>
| |
| |}
| |
| </center>
| |
| The blocks of a PBIBD(3) based on ''A''(3) are:
| |
| <center>
| |
| {|
| |
| |-
| |
| | 124 || 134 || 235 || 456
| |
| |-
| |
| | 125 || 136 || 236 || 456
| |
| |}
| |
| </center>
| |
| The parameters of this PBIBD(3) are: ''v'' = 6, ''b'' = 8, ''k'' = 3, ''r'' = 4 and λ<sub>1</sub> = λ<sub>2</sub> = 2 and λ<sub>3</sub> = 1. Also, for the association scheme we have ''n''<sub>0</sub> = ''n''<sub>2</sub> = 1 and ''n''<sub>1</sub> = ''n''<sub>3</sub> = 2.<ref>{{harvnb|Street|Street|1987|loc=pg. 238}}</ref>
| |
| | |
| ===Properties===
| |
| The parameters of a PBIBD(''m'') satisfy:<ref>{{harvnb|Street|Street|1987|loc=pg. 240, Lemma 4}}</ref>
| |
| # <math> vr = bk </math>
| |
| # <math> \sum_{i=1}^{m} n_i = v-1 </math>
| |
| # <math> \sum_{i=1}^{m} n_i \lambda_i = r(k-1) </math>
| |
| # <math> \sum_{u=0}^{m} p_{ju}^h = n_j </math>
| |
| # <math> n_i p_{jh}^{i} = n_j p_{ih}^{j} </math>
| |
| | |
| A PBIBD(1) is a BIBD and a PBIBD(2) in which λ<sub>1</sub> = λ<sub>2</sub> is a BIBD.<ref>{{harvnb|Colburn|Dinitz|2007|loc=pg. 562, Remark 42.3 (4)}}</ref>
| |
| | |
| ===Two associate class PBIBDs===
| |
| PBIBD(2)s have been the studied the most since they are the simplest and most useful of the PBIBDs.<ref>{{harvnb|Street|Street|1987|loc=pg. 242}}</ref> They fall into six types<ref>Not a mathematical classification since one of the types is a catch-all "and everything else".</ref> based on a classification of the ''then known'' PBIBD(2)s by {{harvtxt|Bose|Shimamoto|1952}}:<ref>{{harvnb|Raghavarao|1988|loc=pg. 127}}</ref>
| |
| # group divisible;
| |
| # triangular;
| |
| # Latin square type;
| |
| # cyclic;
| |
| # partial geometry type;
| |
| # miscellaneous.
| |
| | |
| ==Applications==
| |
| The mathematical subject of block designs originated in the statistical framework of [[design of experiments]]. These designs were especially useful in applications of the technique of [[Analysis of variance|analysis of variance (ANOVA)]]. This remains a significant area for the use of block designs.
| |
| | |
| While the origins of the subject are grounded in biological applications (as is some of the existing terminology), the designs are used in many applications where systematic comparisons are being made, such as in [[software testing]].
| |
| | |
| The [[incidence matrix]] of block designs provide a natural source of interesting [[block code]]s that are used as [[error correcting code]]s.
| |
| | |
| ==See also==
| |
| * [[Randomized block design]]
| |
| * [[Combinatorial design]]
| |
| * [[Incidence geometry]]
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==References==
| |
| * {{cite journal
| |
| | author = Aschbacher, Michael
| |
| | title = On collineation groups of symmetric block designs
| |
| | journal = Journal of Combinatorial Theory, Series A
| |
| | volume = 11
| |
| | issue = 3
| |
| | year = 1971
| |
| | pages = 272–281
| |
| | doi = 10.1016/0097-3165(71)90054-9}}
| |
| | |
| * {{citation|last1=Assmus|first1=E.F.|last2=Key|first2=J.D.|title=Designs and Their Codes|publisher=Cambridge University Press|year=1992|place=Cambridge|isbn=0-521-41361-3}}
| |
| | |
| *{{citation|first1=Thomas|last1=Beth|first2=Dieter|last2=Jungnickel|first3=Hanfried|last3=Lenz|title=Design Theory|publisher=[[Cambridge University Press]]|location=Cambridge|year=1986}}. 2nd ed. (1999) ISBN 978-0-521-44432-3.
| |
| | |
| * [[R. C. Bose]], "A Note on Fisher's Inequality for Balanced Incomplete Block Designs", ''[[Annals of Mathematical Statistics]]'', 1949, pages 619–620.
| |
| | |
| * {{citation|last=Bose|first=R. C.|last2=Shimamoto|first2=T.|title=Classification and analysis of partially balanced incomplete block designs with two associate classes|journal=Journal of the American Statistical Association|year=1952|volume=47|pages=151–184|authorlink=R. C. Bose}}
| |
| | |
| * {{citation|last1=Cameron|first1=P. J.|last2=van Lint|first2=J. H.|title=Designs, Graphs, Codes and their Links|year=1991|publisher=Cambridge University Press|place=Cambridge|isbn=0-521-42385-6}}
| |
| | |
| * {{citation|last1=Colbourn|first1=Charles J.|last2=Dinitz|first2=Jeffrey H.|title=Handbook of Combinatorial Designs|year=2007|publisher=Chapman & Hall/ CRC|location=Boca Raton|isbn=1-58488-506-8|edition=2nd Edition}}
| |
| | |
| * R. A. Fisher, "An examination of the different possible solutions of a problem in incomplete blocks", ''[[Annals of Eugenics]]'', volume 10, 1940, pages 52–75.
| |
| | |
| * {{citation|last=Hall, Jr. |first=Marshall|title=Combinatorial Theory|edition=2nd|publisher= Wiley-Interscience|place=New York|year=1986|isbn=0-471-09138-3}}
| |
| | |
| * {{citation|last1=Hughes|first1=D.R.|last2=Piper|first2=E.C.|title=Design theory|publisher=Cambridge University Press|place=Cambridge|year=1985|isbn=0-521-25754-9}}
| |
| | |
| * {{cite journal
| |
| | author = Kaski, Petteri and Östergård, Patric
| |
| | title = There Are Exactly Five Biplanes with ''k'' = 11
| |
| | journal = Journal of Combinatorial Designs
| |
| | volume = 16
| |
| | year = 2008
| |
| | issue = 2
| |
| | pages = 117–127
| |
| | doi = 10.1002/jcd.20145
| |
| | mr = 2008m:05038 }}
| |
| | |
| * {{citation|last=Lander|first=E. S.|title=Symmetric Designs: An Algebraic Approach|year=1983|publisher=Cambridge University Press|location=Cambridge}}
| |
| | |
| * {{citation|last=Lindner|first=C.C.|last2=Rodger|first2=C.A.|title=Design Theory|year=1997|publisher=CRC Press|location=Boca Raton|isbn=0-8493-3986-3}}
| |
| | |
| * {{cite book
| |
| |title=Constructions and Combinatorial Problems in Design of Experiments
| |
| |author=[[Damaraju Raghavarao|Raghavarao, Damaraju]]
| |
| |location=New York
| |
| |year=1988
| |
| |edition=corrected reprint of the 1971 Wiley
| |
| |publisher=Dover
| |
| }}
| |
| | |
| * {{cite book
| |
| |title=Block Designs: Analysis, Combinatorics and Applications
| |
| |author=[[Damaraju Raghavarao|Raghavarao, Damaraju]] and Padgett, L.V.
| |
| |location=
| |
| |year=2005
| |
| |edition=
| |
| |publisher=World Scientific
| |
| }}
| |
| | |
| * {{citation|last=Ryser|first=Herbert John|title=Combinatorial Mathematics (Carus Monograph #14)|year=1963|publisher=Mathematical Association of America|chapter=Chapter 8: Combinatorial Designs}}
| |
| | |
| * {{cite journal
| |
| | first1 = Chester J.
| |
| | last1 = Salwach
| |
| | first2 = Joseph A.
| |
| | last2 = Mezzaroba
| |
| | title = The four biplanes with ''k'' = 9
| |
| | journal = Journal of Combinatorial Theory, Series A
| |
| | volume = 24
| |
| | issue = 2
| |
| | year = 1978
| |
| | pages = 141–145
| |
| | doi = 10.1016/0097-3165(78)90002-X}}
| |
| | |
| * [[S. S. Shrikhande]], and [[Bhat-Nayak Vasanti N.|Vasanti N. Bhat-Nayak]], Non-isomorphic solutions of some balanced incomplete block designs I – [[Journal of Combinatorial Theory]], 1970
| |
| | |
| * {{citation|last=Stinson|first=Douglas R.|title=Combinatorial Designs: Constructions and Analysis|year=2003|publisher=Springer|location=New York|isbn=0-387-95487-2}}
| |
| | |
| *{{cite book
| |
| |author=Street, Anne Penfold and Street, Deborah J.
| |
| |title=Combinatorics of Experimental Design
| |
| |publisher=Oxford U. P. [Clarendon]
| |
| |year=1987
| |
| |pages=400+xiv
| |
| |isbn=0-19-853256-3
| |
| }}
| |
| | |
| * {{cite book | last1 = van Lint | first1 = J.H. | first2 = R.M. | last2 = Wilson | year = 1992 | title = A Course in Combinatorics | location = Cambridge | publisher = Cambridge University Press}}
| |
| | |
| ==External links==
| |
| *[http://designtheory.org DesignTheory.Org]: Databases of combinatorial, statistical, and experimental block designs. Software and other resources hosted by the School of Mathematical Sciences at Queen Mary College, University of London.
| |
| *[http://www.maths.qmul.ac.uk/~pjc/design/resources.html Design Theory Resources]: [[Peter Cameron (mathematician)|Peter Cameron]]'s page of web based design theory resources.
| |
| | |
| * {{mathworld |urlname=BlockDesign|title=Block Designs}}
| |
| | |
| {{Experimental design|state=expanded}}
| |
| | |
| [[Category:Combinatorics]]
| |
| [[Category:Design theory]]
| |
| [[Category:Set families]]
| |
| [[Category:Design of experiments]]
| |