Abstract
By extending results developed for q a prime or a prime power we develop methods for generating all q n-m regular designs for q a product of distinct primes, along with their confounded interactions or defining contrasts. The method of generation produces a unique and decodable number for each such design and explicit formulae are supplied for each step of the coding and decoding algorithm. The case where q is a product of two separate primes is studied in detail, with indications given for extensions to more primes and different values of q for each factor, this latter case covering in particular the situation where each q is a single, possibly distinct, prime.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bailey, R.A., Gilchrist, F.H.L. and Patterson, H.D. (1977). Identification of effects and confounding patterns in factorial designs. Biometrika 64, 347–354.
Bedford, D. (1995a). Private communication. University of Keele.
Bedford, D. (1995a). Orthomorphisms and near orthomorphisms of groups and orthogonal Latin squares: a survey. Preprint, University of Keele.
Constantine, G.M. (1987). Combinatorial Theory and Statistical Design. New York: Wiley.
Finney, D.J. (1945). The fractional replication of factorial arrangements. Ann. Eugen., Lond. 12, 291–301.
John, J.A. and Dean, A.M. (1975). Single replicate factorial experiments in generalized cyclic designs. I. Symmetrical arrangements. J. R. Statist. Soc. B 37, 72–76.
John, J.A. and Williams, E. R. (1995). Cyclic and Computer Generated Designs. London: Chapman & Hall.
Kempthorne, O. (1947). A simple approach to confounding and fractional replication in factorial experiments. Biometrika 34, 255–272.
Laycock, P.J. and Rowley, P.J. (1995). A Method for generating and labelling all regular fractions or blocks for q^(n-m) designs. J. Roy. Statist. Soc. B 57, 191–204.
Laycock, P.J. and Rowley, P.J. (1999). On generating and classifying all q^(n-m-1) regularly blocked fractional designs. In Eds. S.M. Ermakov, N. Balakrishnan and V.B. Melas, pp. 159–170. Boston: Birkhauser.
Mullen, G.L. (1995). A candidate for the “Next Fermat Problem”. The Mathematical Intelligencer 17, No.3. New York: Springer-Verlag.
Parker, E.T. (1960). Orthogonal Latin squares. Proc. Nat. Acad. Sci. U.S.A. 21, 859–862.
Patterson, H.D. and Bailey, R.A. (1978). Design keys for factorial experiments. Appl. Statist. 27, 335–343.
Raktoe, B.L., Hedayat, A. and Federer, W.T. (1981). Factorial Designs. New York: Wiley.
Street, A.P. and Street, D.J. (1987). Combinatorics of Experimental Design. Oxford: Clarendon Press.
Wynn, H.P., Sivaloganathan, S., Buck, R.J. and Lewis, S.M. (1996). GENERATE: An algorithm for the computer generation of orthogonal arrays with specified alias structure. Preprint, City University, London.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Laycock, P.J., Rowley, P.J. (2001). On Generating and Classifying All Q N-M Regular Designs for Square-Free Q . In: Atkinson, A., Bogacka, B., Zhigljavsky, A. (eds) Optimum Design 2000. Nonconvex Optimization and Its Applications, vol 51. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3419-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3419-5_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4846-5
Online ISBN: 978-1-4757-3419-5
eBook Packages: Springer Book Archive