Abstract
In Chapter 3, we have considered several characterizations for factorial designs which are balanced and have OFS. The emphasis on balance, however, has a drawback that the resulting designs, although theoretically elegant and simple to interpret, may become too large and hence expensive. More specifically, the combinatorial restrictions imposed by an attempt to achieve a balance over all the interactions (cf Theorem 3.2.2) may call for a prohibitively large number of replications. Because of this reason, since the early seventies, work started on conditions for OFS alone. A brief review of these developments up to that stage was given by Chatterjee (1982). In this chapter, we propose to present a comprehensive account of several characterizations for OFS considering both connected and disconnected designs. The use of these results for construction purposes will be indicated later in the monograph. Before presenting the main results of this chapter, we introduce some preliminaries that will be useful in the subsequent development.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gupta, S., Mukerjee, R. (1989). Characterizations for Orthogonal Factorial Structure. In: A Calculus for Factorial Arrangements. Lecture Notes in Statistics, vol 59. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8730-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8730-3_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97172-8
Online ISBN: 978-1-4419-8730-3
eBook Packages: Springer Book Archive