Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-25T19:40:08.634Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Class of Arrangements

Published online by Cambridge University Press:  20 January 2009

C. Radhakrishna Rao
C. Radhakrishna Rao
Affiliation:
King's College, Cambridge.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, I introduce a class of arrangements called arrays of strength d and discuss methods of constructing them with the help of finite geometrical configurations and algebraic groups involving elements of a Galois field. The definitions of arrays of strength d and other configurations that are used are given below.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 8 , Issue 3 , December 1949 , pp. 119 - 125
Copyright
Copyright © Edinburgh Mathematical Society 1949

References

REFERENCES

Bhattacharya, A., “A note on Ramamurti's problem of maximal sets,” Sankhya, 6 (1942), 189.Google Scholar
Fisher, R. A. and Yates, F., “The 6 × 6 Latin squares,” Proc. Camb. Phil. Soc., 146 (1934), 1.Google Scholar
Plackett, R. L. and Burman, J. P., “The design of optimum multifactorial experiments,” Biometrika, 33 (1946), 305.CrossRefGoogle Scholar
Rao, C. R., “On hypercubes of strength d and a system of confounding in factorial experiments,” Bull. Calcutta Math. Soc., 38 (1946), 1.Google Scholar