McKay, Brendan D.; Wanless, Ian M. On the number of Latin squares. (English) Zbl 1073.05013 Ann. Comb. 9, No. 3, 335-344 (2005). Summary: We (1) determine the number of Latin rectangles with 11 columns and each possible number of rows, including the Latin squares of order 11, (2) answer some questions of Alter by showing that the number of reduced Latin squares of order \(n\) is divisible by \(f!\) where \(f\) is a particular integer close to \(\frac{1}{2}n\), (3) provide a formula for the number of Latin squares in terms of permanents of \((+1,-1)\)-matrices, (4) find the extremal values for the number of 1-factorisations of \(k\)-regular bipartite graphs on \(2n\) vertices whenever \(1 \leq k \leq n \leq 11\), (5) show that the proportion of Latin squares with a non-trivial symmetry group tends quickly to zero as the order increases. Cited in 58 Documents MSC: 05B15 Orthogonal arrays, Latin squares, Room squares 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 15A15 Determinants, permanents, traces, other special matrix functions Keywords:enumeration; 1-factorisation; permanent; regular bipartite graph Software:nauty PDFBibTeX XMLCite \textit{B. D. McKay} and \textit{I. M. Wanless}, Ann. Comb. 9, No. 3, 335--344 (2005; Zbl 1073.05013) Full Text: DOI arXiv Online Encyclopedia of Integer Sequences: Number of reduced Latin squares of order n; also number of labeled loops (quasigroups with an identity element) with a fixed identity element. Number of 1-factorizations of K_{n,n}. a(n) is the number of (n-2) X n normalized Latin rectangles. Number of Latin squares of order n; or labeled quasigroups.