Abstract
We consider the following problem arising in agricultural statistics. Suppose that a large number of plants are set out on a regular grid, which may be triangular, square or hexagonal, and that among these plants, half are to be given one and half the other of two possible treatments. For the sake of statistical balance, we require also that, if one plant in every k plants has i of its immediate neighbours receiving the same treatment as itself, then k is constant over all possible values of i. Such arrays are constructed for the square grid, and special properties are considered which may simplify their application.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.M. Cormack, private communication, 1978.
D.J. Gates, private communication, 1978.
Branko Grünbaum and Geoffrey C. Shephard, Tilings by regular polygons, Math. Mag. 50 (1977) 227–247; 51 (1978) 205–206.
Ross Honsberger, Mathematical Gems II, (Dolciani Mathematical Expositions Volume 2, Math. Assoc. of America, 1976).
Joan P. Hutchinson, On words with prescribed overlapping subsequences, Utilitas Math. 7 (1975) 241–250.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag
About this paper
Cite this paper
Street, A.P., Macdonald, S.O. (1979). Balanced binary arrays I: The square grid. In: Horadam, A.F., Wallis, W.D. (eds) Combinatorial Mathematics VI. Lecture Notes in Mathematics, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0102695
Download citation
DOI: https://doi.org/10.1007/BFb0102695
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09555-2
Online ISBN: 978-3-540-34857-3
eBook Packages: Springer Book Archive