Chessboard squares (Q1894757): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/dm/ChetwyndR95, #quickstatements; #temporary_batch_1731530891435
 
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dm/ChetwyndR95 / rank
 
Normal rank

Latest revision as of 22:06, 13 November 2024

scientific article
Language Label Description Also known as
English
Chessboard squares
scientific article

    Statements

    Chessboard squares (English)
    0 references
    0 references
    0 references
    24 July 1995
    0 references
    We consider the problem posed by \textit{R. Häggkvist} [Discrete Math. 75, No. 1-3, 253-254 (1989; Zbl 0669.05015)] on finding \(n\times n\) arrays which are avoidable. An array is said to be avoidable if an \(n\times n\) latin square on the same symbols can be found which differs from the given array in every cell. We describe a family of arrays, known as chessboard arrays, and classify these arrays as avoidable or non- avoidable.
    0 references
    chessboard squares
    0 references
    avoidable array
    0 references
    latin square
    0 references
    chessboard arrays
    0 references

    Identifiers