English
Related papers

Related papers: Latin Squares whose transversals share many entrie…

200 papers

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…

Combinatorics · Mathematics 2015-10-27 Ian M. Wanless

A $k$-plex in a latin square of order $n$ is a selection of $kn$ entries that includes $k$ representatives from each row and column and $k$ occurrences of each symbol. A $1$-plex is also known as a transversal. It is well known that if $n$…

Combinatorics · Mathematics 2018-01-10 Nicholas J. Cavenagh , Ian M. Wanless

The logarithm of the maximum number of transversals over all latin squares of order $n$ is greater than $\frac{n}{6}(\ln n+ O(1))$.

Combinatorics · Mathematics 2018-11-01 Vladimir N. Potapov

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…

Combinatorics · Mathematics 2007-05-23 Sherman K. Stein

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…

Combinatorics · Mathematics 2021-03-02 Anthony B. Evans , Adam Mammoliti , Ian Wanless

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…

Combinatorics · Mathematics 2015-09-21 Joshua M. Browning , Petr Vojtěchovský , Ian M. Wanless

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

Combinatorics · Mathematics 2014-10-27 Peter J. Dukes , Christopher M. van Bommel

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…

Combinatorics · Mathematics 2023-05-24 Sean Eberhard , Freddie Manners , Rudi Mrazović

A multi-latin square of order $n$ and index $k$ is an $n\times n$ array of multisets, each of cardinality $k$, such that each symbol from a fixed set of size $n$ occurs $k$ times in each row and $k$ times in each column. A multi-latin…

Combinatorics · Mathematics 2010-07-26 Nicholas Cavenagh , Carlo Hamalainen , James G. Lefevre , Douglas S. Stones

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

Combinatorics · Mathematics 2020-04-30 Darcy Best , Ian M. Wanless

In a latin square of order $n$, a near transversal is a collection of $n-1$ cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Brualdi, Ryser, and Stein asserts that every latin square…

Combinatorics · Mathematics 2019-08-13 Luis Goddyn , Kevin Halasz

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…

Combinatorics · Mathematics 2021-12-09 Brendan D. McKay , Ian M. Wanless

A Latin square is an $n$ by $n$ grid filled with $n$ symbols so that each symbol appears exactly once in each row and each column. A transversal in a Latin square is a collection of cells which do not share any row, column, or symbol. This…

Combinatorics · Mathematics 2024-07-01 Richard Montgomery

A Latin square $L(n,k)$ is a square of order $n$ with its entries colored with $k$ colors so that all the entries in a row or column have different colors. Let $d(L(n,k))$ be the minimal number of colored entries of an $n \times n$ square…

Combinatorics · Mathematics 2007-05-23 Karola Meszaros

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

Combinatorics · Mathematics 2009-09-14 Brendan D. McKay , Ian M. Wanless

Until now the problem counting Latin rectangles m x n has been solved with an explicit formula for m = 2, 3 and 4 only. In the present paper an explicit formula is provided for the calculation of the number of Latin rectangles for any order…

Combinatorics · Mathematics 2007-11-06 Aurelio de Gennaro

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…

Combinatorics · Mathematics 2023-10-31 Richard Montgomery

We define a cover of a Latin square to be a set of entries that includes at least one representative of each row, column and symbol. A cover is minimal if it does not contain any smaller cover. A partial transversal is a set of entries that…

Combinatorics · Mathematics 2020-04-30 Darcy Best , Trent Marbach , Rebecca J. Stones , Ian M. Wanless

We are seeking a sufficient condition that forces a transversal in a generalized Latin square. A generalized Latin square of order $n$ is equivalent to a proper edge-coloring of $K_{n,n}$. A transversal corresponds to a multicolored perfect…

Combinatorics · Mathematics 2017-01-31 János Barát , Zoltán Lóránt Nagy

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…

Combinatorics · Mathematics 2018-01-10 Darcy Best , Kevin Hendrey , Ian M. Wanless , Tim E. Wilson , David R. Wood
‹ Prev 1 2 3 10 Next ›