Skip to main content

Part of the book series: Lecture Notes in Statistics ((LNS,volume 170))

  • 364 Accesses

Abstract

Resolvable block designs, introduced in Section 6.0.3, are important in practice because it is often useful to be able to perform an experiment with replicates one or more at a time. The present chapter is devoted only to those among (α,α2, …,αa)-resolvable block designs which are a-resolvable for α ≥ 1, according to the concepts discussed in Section 6.0.3. A 1-resolvable block design is simply called resolvable in the usual sense of Bose (1942a). Note that α-resolvable block designs are necessarily equireplicate. Now, recalling the general form of Definition 6.0.2, one can write as follows. A block design with parameters v, b, r, kis said to be a-resolvable if the blocks can be separated into a sets (superblocks) of bh blocks each (b=∑ a h=1 b h ) such that the hth superblock contains every treatment exactly a times, for h = 1,2, …,a. Further, note that if the block design is proper, i.e., k = k1b,, then b1 = b2 = … = ba(= b0, say). Then one gets b = b0a, r = αa, vα = kb0 and bα = rb0. An a-resolvable proper block design with parameters v, b, r, k is said to be affine a-resolvable if every two distinct blocks from the same superblock intersect in the same number, q1, of treatments, whereas any two blocks from different superblocks intersect in the same number, q2, of treatments. Here q1 = (α - 1)k/(b0 - 1) and q2 = k2/v (see Section 6.0.3). A more general case can be seen in Definition 6.0.3.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Caliński, T., Kageyama, S. (2003). Resolvable Designs. In: Block Designs: A Randomization Approach. Lecture Notes in Statistics, vol 170. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9246-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-9246-8_4

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-95470-7

  • Online ISBN: 978-1-4419-9246-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics