Related papers: Defining sets which intersect each Latin trade at …

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…

Symmetries of a partial Latin square are determined by its autotopism group. Analogously to the case of Latin squares, given an isotopism $\Theta$, the cardinality of the set $\mathcal{PLS}_{\Theta}$ of partial Latin squares which are…

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

A latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots,h_k$ such that $h_1+\dots+h_k = n$ is known as a realization. The existence of realizations is a partially solved problem with a few general results for an…

Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…

A Latin square of order $n$ is an $n\times n$ matrix in which each row and column contains each of $n$ symbols exactly once. For $\epsilon>0$, we show that with high probability a uniformly random Latin square of order $n$ has no proper…

In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking techniques, and on several heuristic optimizations and bit…

A $k$-net($n$) is a combinatorial design equivalent to $k-2$ mutually orthogonal Latin squares of order $n$. A relation in a net is a linear dependency over $\mathbb{F}_2$ in the incidence matrix of the net. A computational enumeration of…

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…

Latin squares have been historically used in order to create statistical designs in which, starting from a small number of experiments, it can be obtained a large experimental space. In this sense, the optimization of the selection of Latin…

It is shown that if $F$ denotes the number of filled cells in a superimposed pair of maximal orthogonal partial Latin squares of order $n$, then $F\ge n^2/3$. This resolves a conjecture raised in an earlier paper by the current authors. It…

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…

A classical question in combinatorics is the following: given a partial latin square P, when can we complete P to a latin square L? In this paper, we will investigate the class of \leq\epsilon-dense partial latin squares: partial latin…

A $d$-dimensional Latin hypercube of order $n$ is a $d$-dimensional array containing symbols from a set of cardinality $n$ with the property that every axis-parallel line contains all $n$ symbols exactly once. We show that for $(n, d)…

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

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…

For Latin squares the units (rows and columns) have fixed sum. The same holds for rows, columns, and blocks in Sudokus. Summing the elements of a unit yields a linear equation, and the set of all such equations forms a system of linear…

We derive necessary and sufficient conditions for there to exist a latin square of order $n$ containing two subsquares of order $a$ and $b$ that intersect in a subsquare of order $c$. We also solve the case of two disjoint subsquares. We…

Latin squares are interesting combinatorial objects with many applications. When working with Latin squares, one is sometimes led to deal with partial Latin squares, a generalization of Latin squares. One of the problems regarding partial…

We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $\gamma > 0$ such that if $n=2t$ and $A$ is a $3$-dimensional $n\times n\times…