中文
相关论文

相关论文: Latin squares and their defining sets

200 篇论文

A quantum Latin square of order $n$ (denoted as QLS$(n)$) is an $n\times n$ array whose entries are unit column vectors from the $n$-dimensional Hilbert space $\mathcal{H}_n$, such that each row and column forms an orthonormal basis. Two…

量子物理 · 物理学 2025-07-09 Ying Zhang , Xin Wang , Lijun Ji

A $k \times n$ partial Latin rectangle is \textit{$C$-sparse} if the number of nonempty entries in each row and column is at most $C$ and each symbol is used at most $C$ times. We prove that the probability a uniformly random $k \times n$…

组合数学 · 数学 2023-11-10 Alexander Divoux , Tom Kelly , Camille Kennedy , Jasdeep Sidhu

An array is row-Latin if no symbol is repeated within any row. An array is Latin if it and its transpose are both row-Latin. A transversal in an $n\times n$ array is a selection of $n$ different symbols from different rows and different…

组合数学 · 数学 2018-01-10 Darcy Best , Kevin Hendrey , Ian M. Wanless , Tim E. Wilson , David R. Wood

A transversal in an $n \times n$ latin square is a collection of $n$ entries not repeating any row, column, or symbol. Kwan showed that almost every $n \times n$ latin square has $\bigl((1 + o(1)) n / e^2\bigr)^n$ transversals as $n \to…

组合数学 · 数学 2023-05-24 Sean Eberhard , Freddie Manners , Rudi Mrazović

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$…

组合数学 · 数学 2019-10-08 Simona Boyadzhiyska , Shagnik Das , Tibor Szabó

Suppose that $k$ is a function of $n$ and $n\to\infty$. We show that with probability $1-O(1/n)$, a uniformly random $k\times n$ Latin rectangle contains no proper Latin subsquare of order $4$ or more, proving a conjecture of Divoux, Kelly,…

组合数学 · 数学 2025-05-01 Jack Allsop , Ian M. Wanless

A Latin square is reduced if its first row and column are in natural order. For Latin squares of a particular order $n$ there are four possible different parities. We confirm a conjecture of Stones and Wanless by showing asymptotic equality…

组合数学 · 数学 2016-10-21 Nicholas J. Cavenagh , Ian M. Wanless

We show that any partial Latin square of order $n$ can be embedded in a Latin square of order at most $16n^2$ which has at least $2n$ mutually orthogonal mates. We also show that for any $t\geq 2$, a pair of orthogonal partial Latin squares…

组合数学 · 数学 2018-11-13 Diane M. Donovan , Mike Grannell , Emine Şule Yazıcı

To get another from a given latin square, we have to change at least 4 entries. We show how to find these entries and how to change them.

组合数学 · 数学 2019-02-18 I. I. Deriyenko

A Latin square of order $n$ is an $n$ by $n$ grid filled using $n$ symbols so that each symbol appears exactly once in each row and column. A transversal in a Latin square is a collection of cells which share no symbol, row or column. The…

组合数学 · 数学 2023-10-31 Richard Montgomery

Let m and n be integers, $2 \leq m \leq n$. An m by n array consists of mn cells, arranged in m rows and n columns, and each cell contains exactly one symbol. A transversal of an array consists of m cells, one from each row and no two from…

组合数学 · 数学 2007-05-23 Sherman K. Stein

We introduce a notion of parity for transversals, and use it to show that in Latin squares of order $2 \bmod 4$, the number of transversals is a multiple of 4. We also demonstrate a number of relationships (mostly congruences modulo 4)…

组合数学 · 数学 2020-04-30 Darcy Best , Ian M. Wanless

Let $L(n)$ be the number of Latin squares of order $n$, and let $L^{\textrm{even}}(n)$ and $L^{\textrm{odd}}(n)$ be the number of even and odd such squares, so that $L(n) = L^{\textrm{even}}(n) + L^{\textrm{odd}}(n)$. The Alon-Tarsi…

组合数学 · 数学 2014-12-25 Levent Alpoge

A partial transversal $T$ of a Latin square $L$ is a set of entries of $L$ in which each row, column and symbol is represented at most once. A partial transversal is maximal if it is not contained in a larger partial transversal. Any…

组合数学 · 数学 2021-03-02 Anthony B. Evans , Adam Mammoliti , Ian Wanless

In a Latin square, every row can be interpreted as a permutation, and therefore has a parity (even or odd). We prove that in a uniformly random $n\times n$ Latin square, the $n$ row parities are very well approximated by a sequence of $n$…

概率论 · 数学 2025-09-19 Matthew Kwan , Kalina Petrova , Mehtaab Sawhney

An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in…

离散数学 · 计算机科学 2011-11-09 R. N. Mohan , Moon Ho Lee , Subash Pokreal

Two latin squares are orthogonal if, when they are superimposed, every ordered pair of symbols appears exactly once. This definition extends naturally to `incomplete' latin squares each having a hole on the same rows, columns, and symbols.…

组合数学 · 数学 2014-10-27 Peter J. Dukes , Christopher M. van Bommel

Latin squares are well studied combinatorial objects. In this paper we generalize the concept and propose new objects like Latin triangles, free Latin squares, Latin tetrahedra, free Latin cubes, etc. We start with a classic definition of…

组合数学 · 数学 2016-04-05 Miguel G. Palomo

A critical set in an n x n array is a set C of given entries, such that there exists a unique extension of C to an n x n Latin square and no proper subset of C has this property. The cardinality of the largest critical set in any Latin…

组合数学 · 数学 2007-05-23 Richard Bean , E. S. Mahmoodian

A Latin hypercuboid of order $n$ is a $d$-dimensional matrix of dimensions $n\times n\times\cdots\times n\times k$, with symbols from a set of cardinality $n$ such that each symbol occurs at most once in each axis-parallel line. If $k=n$…