Enumeration of semi-Latin squares

DOI10.1016/S0012-365X(96)00217-8zbMath0901.05017OpenAlexW2054371155MaRDI QIDQ1356446

O. Diekmann

Publication date: 22 November 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00217-8

zbMATH Keywords

permutationsisomorphism classessemi-Latin square

Mathematics Subject Classification ID

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

Related Items (7)

Balanced semi-Latin rectangles: properties, existence and constructions for block size two ⋮ A Howell design admitting \(A_ 5\) ⋮ Constructions for regular-graph semi-Latin rectangles with block size two ⋮ Orthogonal partitions in designed experiments ⋮ Multi-Latin squares ⋮ A new construction for efficient semi-Latin squares ⋮ Designs, Groups and Computing

Uses Software

• nauty

Cites Work

• Translation nets and fixed-point-free group automorphisms
• Semi-Latin squares
• Optimality of some two-associate-class partially balanced incomplete- block designs
• Optimal semi-Latin squares with side six and block size two
• THE 7 × 7 SQUARES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of semi-Latin squares