Enumeration of Latin squares with conjugate symmetry

DOI10.1002/jcd.21814arXiv2104.07902OpenAlexW3211746967MaRDI QIDQ6146183

Brendan D. McKay, Ian M. Wanless

Publication date: 5 February 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.07902

zbMATH Keywords

idempotent Latin squaresymmetric Latin squarereduced Latin squaresemisymmetric Latin squaretotally symmetric Latin squareunipotent Latin square

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (1)

A computational approach to analyze the Hadamard quasigroup product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Switching in one-factorisations of complete graphs
• Cycle switches in Latin squares
• On the number of 8\(\times 8\) Latin squares
• The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
• Practical graph isomorphism. II.
• On the number of Latin squares
• Cycle structure of autotopisms of quasigroups and latin squares
• Latin Squares with Restricted Transversals
• Crossed-Inverse and Related Loops
• Small latin squares, quasigroups, and loops
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• Symmetries that latin squares inherit from 1‐factorizations
• The Steiner triple systems of order 19
• Autoparatopisms of Quasigroups and Latin Squares
• Quasigroupes demi‐symétriques. Isotopies préservant la demi‐symétrie

This page was built for publication: Enumeration of Latin squares with conjugate symmetry