arXiv 2104.079022021-04-16math.CO

Enumeration of Latin squares with conjugate symmetry

Brendan D. McKay, Ian M. Wanless

发表信息：: J Combin Des. 30 (2022) 105-130
DOI：: 10.1002/jcd.21814

英文摘要：

A Latin square has six conjugate Latin squares obtained by uniformly permuting its (row, column, symbol) triples. We say that a Latin square has conjugate symmetry if at least two of its six conjugates are equal. We enumerate Latin squares with conjugate symmetry and classify them according to several common notions of equivalence. We also do similar enumerations under additional hypotheses, such as assuming the Latin square is reduced, diagonal, idempotent or unipotent. Our data corrected an error in earlier literature and suggested several patterns that we then found proofs for, including (1) The number of isomorphism classes of semisymmetric idempotent Latin squares of order $n$ equals the number of isomorphism classes of semisymmetric unipotent Latin squares of order $n+1$, and (2) Suppose $A$ and $B$ are totally symmetric Latin squares of order $n\not\equiv0\bmod3$. If $A$ and $B$ are paratopic then $A$ and $B$ are isomorphic.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

An enumeration of spherical latin bitrades

A latin bitrade (T1, T2) is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. A genus may be associated to a latin bitrade by constructing an embedding of the underlying graph in an oriented surface. We report computational enumeration results on the number of spherical (genus 0) latin bitrades up to size 24.

2009-09-16math.CO

Lattice path enumeration for semi-magic squares by Latin rectangles

Similar to how standard Young tableaux represent paths in the Young lattice, Latin rectangles may be use to enumerate paths in the poset of semi-magic squares with entries zero or one. The symmetries associated to determinant preserve this poset, and we completely describe the orbits, covering data, and maximal chains for squares of size 4, 5, and 6. The last item gives the number of Latin squares in these cases. To calculate efficiently for size 6, we in turn identify orbits with certain equivalence classes of hypergraphs.

2022-02-13math.CO

Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method

The current paper deals with the enumeration and classification of the set $\mathcal{SOR}_{r,n}$ of self-orthogonal $r\times r$ partial Latin rectangles based on $n$ symbols. These combinatorial objects are identified with the independent sets of a Hamming graph and with the zeros of a radical zero-dimensional ideal of polynomials, whose reduced Gröbner basis and Hilbert series can be computed to determine explicitly the set $\mathcal{SOR}_{r,n}$. In particular, the cardinality of this set is shown for $r\leq 4$ and $n\leq 9$ and several formulas on the cardinality of $\mathcal{SOR}_{r,n}$ are…

2014-10-04math.CO

Enumeration of MOLS of small order

We report the results of a computer investigation of sets of mutually orthogonal latin squares (MOLS) of small order. For $n\le9$ we 1. Determine the number of orthogonal mates for each species of latin square of order $n$. 2. Calculate the proportion of latin squares of order $n$ that have an orthogonal mate, and the expected number of mates when a square is chosen uniformly at random. 3. Classify all sets of MOLS of order $n$ up to various different notions of equivalence. We also provide a triple of latin squares of order 10 that is the closest to being a set of MOLS so far found.

2014-10-13math.CO

Division sudokus: Invariants, enumeration and multiple partitions

A division sudoku is a latin square whose all six conjugates are sudoku squares. We enumerate division sudokus up to a suitable equivalence, introduce powerful invariants of division sudokus, and also study latin squares that are division sudokus with respect to multiple partitions at the same time. We use nearfields and affine geometry to construct division sudokus of prime power rank that are rich in sudoku partitions.

2021-01-11math.CO

The Enumeration of Cyclic MNOLS

In this paper we study collections of mutually nearly orthogonal Latin squares ($\text{MNOLS}$), which come from a modification of the orthogonal condition for mutually orthogonal Latin squares. In particular, we find the maximum $μ$ such that there exists a set of $μ$ cyclic $\text{MNOLS}$ of order $n$ for $n \leq 18$, as well as providing a full enumeration of sets and lists of $μ$ cyclic $\text{MNOLS}$ of order $n$ under a variety of equivalences with $n \leq 18$. This resolves in the negative a conjecture that proposed the maximum $μ$ for which a set of $μ$ cyclic $\text{MNOLS}$ of order $…

2018-11-05math.CO

更多相关论文收起更多论文

The number of Latin squares of order 11

Constructive and nonconstructive techniques are employed to enumerate Latin squares and related objects. It is established that there are (i) 2036029552582883134196099 main classes of Latin squares of order 11; (ii) 6108088657705958932053657 isomorphism classes of one-factorizations of $K_{11,11}$; (iii) 12216177315369229261482540 isotopy classes of Latin squares of order 11; (iv) 1478157455158044452849321016 isomorphism classes of loops of order 11; and (v) 19464657391668924966791023043937578299025 isomorphism classes of quasigroups of order 11. The enumeration is constructive for the 1151666…

2010-02-08math.CO

相互正交拉丁矩形集合的枚举

Enumeration of Sets of Mutually Orthogonal Latin Rectangles

本文枚举 k≤n≤7 时非同痕的 t 个相互正交 k×n 拉丁矩形集合，定义并追踪齐次、传递及逐步传递结构，并据此说明除 Hughes 平面外阶数至多 9 的射影平面均可由逐步传递 MOLR 构造。

2024-01-19cs.DMmath.CO

基于Galois共轭参数化Hermitian Laplacian矩阵的有向图子结构分析与圈枚举方法

Substructure Analysis and Cycle Enumeration Methods for Oriented Graphs Based on Parameterizing Hermitian Laplacian Matrices by Galois Conjugates

本文研究有向图参数化Hermitian Laplacian矩阵的主子式，证明当参数取本原p次单位根的Galois共轭时行列式之积为p的整数幂，并据此提出枚举子结构中非消失单圈图分量的方法。

2025-07-10math.CO

Triples of Orthogonal Latin and Youden Rectangles For Small Orders

We have performed a complete enumeration of non-isotopic triples of mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$. Here we will present a census of such triples, classified by various properties, including the order of the autotopism group of the triple. As part of this we have also achieved the first enumeration of pairwise orthogonal triples of Youden rectangles. We have also studied orthogonal triples of $k \times 8$ rectangles which are formed by extending mutually orthogonal triples with non-trivial autotopisms one row at a time, and requiring that the autotopism g…

2018-10-30cs.DMmath.CO

Transversals in Latin Squares

A latin square of order $n$ is an $n\times n$ array of $n$ symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of $n$ entries such that no two entries share the same row, column or symbol. Transversals are closely related to the notions of complete mappings and orthomorphisms in (quasi)groups, and are fundamental to the concept of mutually orthogonal latin squares. Here we provide a brief survey of the literature on transversals. We cover (1) existence and enumeration results, (2) generalisations of transversals including partial tra…

2009-03-30math.CO

Enumerating extensions of mutually orthogonal Latin squares

Two $n \times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$ pairwise-orthogonal Latin squares, and the existence and enumeration of these objects has attracted a great deal of attention. Recent work of Keevash and Luria provides, for all fixed $k$, log-asymptotically tight bounds on the number of $k$-MOLS. To study the situation when $k$ grows with $n$, we bound the number of ways a $k$-MOLS can be extended to a $(k+1)$-MOLS. These bo…

2019-10-07math.CO

A Classification of Autoparatopisms of Latin Cubes

A paratopism is an action on a Latin hypercube of dimension d and order n which is an element of the wreath product $S_n \wr S_{d+1}$. A paratopism is said to be an autoparatopism if there is at least one Latin hypercube which is mapped to itself under the action of the paratopism. In this paper we classify autoparatopisms of Latin cubes given d = 3 and $n \in \mathbb{Z^+}$, upto the conjugacy in $S_n \wr S_4$. In order to achieve this objective, we prove that given an autoparatopism $σ \in S_n \wr S_{d+1}$, all the conjugates of $σ$ are autoparatpisms. Also, an important condition is presente…

2019-11-14math.CO

具有两个关系的十阶正交拉丁方：一项可满足性（SAT）研究

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation

School of Computer Science, University of Waterloo（滑铁卢大学计算机学院）；Department of Mathematics and Statistics, University of Windsor（温莎大学数学与统计系）；School of Mathematics and Statistics, Carleton University（卡尔顿大学数学与统计学院）

本文采用SAT求解器方法，验证了Delisle等人关于十阶带两个非平凡关系的拉丁方正交对的穷举枚举结果，该方法效率远高于原回溯代码。

2026-08-21cs.DMmath.CO

$K_{11,11}$的完美1-因子分解

Perfect $1$-factorisations of $K_{11,11}$

研究$K_{11,11}$的完美1-因子分解，发现其与行哈密顿拉丁方的关系，并填补了经典完美1-因子分解文献中的空白。

2026-04-09math.CO

Perfect 1-factorisations of $K_{16}$

We report the results of a computer enumeration that found that there are 3155 perfect 1-factorisations (P1Fs) of the complete graph $K_{16}$. Of these, 89 have a non-trivial automorphism group (correcting an earlier claim of 88 by Meszka and Rosa). We also (i) describe a new invariant which distinguishes between the P1Fs of $K_{16}$, (ii) observe that the new P1Fs produce no atomic Latin squares of order 15 and (iii) record P1Fs for a number of large orders that exceed prime powers by one.

2019-05-18math.CO

群不变量子拉丁方

Group Invariant Quantum Latin Squares

本文引入群不变量子拉丁方，证明其与群代数间保持迹和共轭转置的同构存在自然双射，并给出存在条件及与量子同构凯莱图的联系。

2025-02-28math.COmath.QAquant-ph