Characteristics for distinguishing among balanced incomplete block designs with repeated blocks (Q1069629)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3936284
Language Label Description Also known as
default for all languages
No label defined
    English
    Characteristics for distinguishing among balanced incomplete block designs with repeated blocks
    scientific article; zbMATH DE number 3936284

      Statements

      Characteristics for distinguishing among balanced incomplete block designs with repeated blocks (English)
      0 references
      1986
      0 references
      The class \({\mathcal B}\) of balanced incomplete block designs with parameters v,b,r,k,\(\lambda\) considered here includes designs with repeated blocks. Attention to date has centered on constructing the members of \({\mathcal B}\) and on finding the minimum number of distinct blocks \(d\leq b\). Under the classical model, the usual statistical characteristics do not distinguish among members of \({\mathcal B}\); however, effects related to block totals can be used as distinguishing characteristics. A competing effects model is introduced and is shown to distinguish among members of \({\mathcal B}\). This model is appropriate for intercropping, marketing, and survey investigations. The model is applied to the ten nonisomorphic BIB designs with parameters 7,21,9,3,3. A computer algorithm for obtaining the pairwise treatment by block incidence matrix of this model is given.
      0 references
      optimality
      0 references
      balanced incomplete block designs
      0 references
      repeated blocks
      0 references
      minimum number of distinct blocks
      0 references
      competing effects model
      0 references
      intercropping
      0 references
      marketing
      0 references
      survey investigations
      0 references
      nonisomorphic BIB designs
      0 references
      computer algorithm
      0 references
      0 references
      0 references
      0 references

      Identifiers