An n to 2n embedding of incomplete idempotent latin squares for small values of n

DOI10.1016/S0012-365X(99)00134-XzbMATH Open0943.05023OpenAlexW1974396706MaRDI QIDQ1969778FDOQ1969778

Yanyan Li

Publication date: 27 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00134-x

Recommendations

• Embedding an incomplete latin square in a latin square with a prescribed diagonal
• On completing partial Latin squares with prescribed diagonals
• Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
• Embedding a latin square in a pair of orthogonal latin squares
• scientific article; zbMATH DE number 16253

zbMATH Keywords

incomplete idempotent latin square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cited In (2)

• Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares
• Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice

This page was built for publication: An \(n\) to \(2n\) embedding of incomplete idempotent latin squares for small values of \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969778)