中文
相关论文

相关论文: A new bound on the size of the largest critical se…

200 篇论文

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

组合数学 · 数学 2007-05-23 Hamed Hatami , Ebadollah S. Mahmoodian

A critical set in an $n \times n$ array is a set $C$ of given entries, such that there exists a unique extension of $C$ to an $n\times n$ Latin square and no proper subset of $C$ has this property. For a Latin square $L$, $\scs{L}$ denotes…

组合数学 · 数学 2007-05-23 Mahya Ghandehari , Hamed Hatami , Ebadollah S. Mahmoodian

A critical set in an $n \times n$ Latin square is a minimal set of entries that uniquely identifies it among all Latin squares of the same size. It is conjectured by Nelder in 1979, and later independently by Mahmoodian, and Bate and van…

组合数学 · 数学 2016-09-16 Hamed Hatami , Yingjie Qian

In this note we show that for each Latin square $L$ of order $n\geq 2$, there exists a Latin square $L'\neq L$ of order $n$ such that $L$ and $L'$ differ in at most $8\sqrt{n}$ cells. Equivalently, each Latin square of order $n$ contains a…

组合数学 · 数学 2016-02-26 Nicholas Cavenagh , Reshma Ramadurai

In 1990, Kolesova, Lam and Thiel determined the 283,657 main classes of Latin squares of order 8. Using techniques to determine relevant Latin trades and integer programming, we examine representatives of each of these main classes and…

组合数学 · 数学 2018-07-30 Richard Bean

In 1998, Khodkar showed that the minimal critical set in the Latin square corresponding to the elementary abelian 2-group of order 16 is of size at most 124. Since the paper was published, improved methods for solving integer programming…

组合数学 · 数学 2018-07-30 Richard Bean

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))$.

组合数学 · 数学 2018-11-01 Vladimir N. Potapov

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…

量子物理 · 物理学 2026-01-15 Ying Zhang , Lijun Ji

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…

组合数学 · 数学 2007-05-23 Karola Meszaros

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

A defining set of a Latin square is a partially filled-in Latin square which completes to no other Latin square of the same order. We introduce the concept of a $k$-strong defining set, in which if less than $k$ entries are deleted, the…

组合数学 · 数学 2026-05-28 Richard Bean , Nicholas Cavenagh

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…

组合数学 · 数学 2024-05-08 Michael J. Gill , Adam Mammoliti , Ian M. Wanless

We prove that, for all even $n\geq10$, there exists a latin square of order $n$ with at least one transversal, yet all transversals coincide on $ \big\lfloor n/6 \big\rfloor$ entries. These latin squares have at least $ 19 n^2/36 + O(n)$…

组合数学 · 数学 2024-12-18 Afsane Ghafari , Ian M. Wanless

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

A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an $n\times n$ array is a selection of $n$ cells taken from different rows and columns of the array. The weight of…

组合数学 · 数学 2021-08-17 Darcy Best , Kyle Pula , Ian M. Wanless

A Latin square of order $n$ is an $n\times n$ array which contains $n$ distinct symbols exactly once in each row and column. We define the adjacent distance between two adjacent cells (containing integers) to be their difference modulo $n$,…

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…

组合数学 · 数学 2020-04-30 Darcy Best , Trent Marbach , Rebecca J. Stones , Ian M. Wanless

A Latin square of order $n$ is an $n \times n$ array filled with $n$ symbols such that each symbol appears only once in every row or column and a transversal is a collection of cells which do not share the same row, column or symbol. The…

组合数学 · 数学 2020-05-26 Peter Keevash , Alexey Pokrovskiy , Benny Sudakov , Liana Yepremyan

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…

组合数学 · 数学 2010-07-26 Nicholas Cavenagh , Carlo Hamalainen , James G. Lefevre , Douglas S. Stones
‹ 上一页 1 2 3 10 下一页 ›