Generalized Latin squares. I
type: Item
instance of: scholarly article
title: Generalized Latin squares. I
zbMATH Open document ID: 0687.05008
DOI: 10.1016/0166-218X(89)90052-8
author: K. Appert
published in: Discrete Applied Mathematics
publication date: 1989-01-01T00:00:00Z
review text: New generalizations of latin squares are given by the authors. Several algorithms for constructing such squares are presented. Reviewer's remark: It is unfortunate that the authors did not compare their generalizations with frequency (F) squares. [For definition and some of their properties see e.g. \textit{A. S. Hedayat} and \textit{E. Seiden}, ``F-square and orthogonal F-square design, a generalization of latin square design and orthogonal latin square design'', Ann. Math. Statist. 41, 2035-2044 (1970; Zbl 0215.334)].
Mathematics Subject Classification ID: 05B15
zbMATH DE Number: 4125411
zbMATH Keywords: generalizations of latin squares
reviewed by: József Dénes
MaRDI profile type: Publication
cites work: Generalized latin rectangles I: Construction and decomposition
cites work: Generalized latin rectangles. II: Embedding
cites work: Q4165387
cites work: Independent permutations, as related to a problem of Moser and a theorem of Polya
cites work: Q4769064
cites work: A complete solution to the existence and nonexistence of Knut Vik designs and orthogonal Knut Vik designs
cites work: Theoretical Limitations on the Efficient Use of Parallel Memories
full work available at URL: 0166-218x(89)90052-8
OpenAlex ID: W2004058916
description: scientific article; zbMATH DE number 4125411