Abstract
It is shown how results of Prokhovnik on the number of pattern variants that may be formed byk markers on a square network ofm 2 positions may be derived more simply by means of a combinatorial theorem of Pólya's, which may also be used to solve systematically many other problems of this type.
Similar content being viewed by others
References
Harary, F. The number of linear, directed, rooted, and connected graphs.Trans. Amer. math. Soc., 1955,78, 445–463.
Pólya, G. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, und chemische Verbindungen.Acta Math. 1937,68, 145–254.
Prokhovnik, S. J. Pattern variants on a square field.Psychometrika, 1959,24, 329–341.
Riordan, J.An introduction to combinatorial analysis. New York: Wiley, 1958.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Moon, J.W. A note on “pattern variants on a square field”. Psychometrika 28, 93–95 (1963). https://doi.org/10.1007/BF02289552
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02289552