Enumeration of Latin arrays. II: Case n=4, k 4

MaRDI QIDQ1177968zbMATH OpenFDO

Authors Tao Renji, Shi-Hua Chen

Publication date 26 June 1992

Published in Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

Latin arrays

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15)

Review text

In an earlier paper [Part I, Sci. China, Ser. A 33, No. 12, 1430--1438 (1990; Zbl 0738.05023)] (see above) the same authors introduced the concept of \((n,k)\) Latin arrays and enumerated them for \(n=2,3\). Here they go further and investigate the case when \(n=4\).

Recommendations

• Enumeration of Latin arrays. I: Case \(n\leq 3\)
• scientific article; zbMATH DE number 1159233
• Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
• scientific article; zbMATH DE number 7535772

Cited in

(1)

• Enumeration of Latin arrays. I: Case \(n\leq 3\)

This page was built for publication: Enumeration of Latin arrays. II: Case \(n=4\), \(k\leq 4\)

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