English
Related papers

Related papers: Extendibility of Latin Hypercuboids

200 papers

A $k$-plane of a $d$-dimensional array is a subarray formed by fixing $d-k$ coordinates and allowing the remaining $k$ coordinates to vary freely. A Latin hypercube of dimension $d$ and order $n$ is an $n\times n\times\cdots\times n$ array…

Combinatorics · Mathematics 2026-05-05 Billy Child , Ian M. Wanless

A latin hypercuboid of order $N$ is an $N\times...\times N\times k$ array filled with symbols from the set $\{0,...,N-1\} $ in such a way that every symbol occurs at most once in every line. If $k=N$, such an array is a latin hypercube. We…

Combinatorics · Mathematics 2011-01-20 Vladimir N. Potapov

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

Combinatorics · Mathematics 2023-10-04 Jack Allsop , Ian M. Wanless

Given two integers $m$ and $n$ with $m\leq n$, a Latin rectangle of size $m\times n$ is a bi-dimensional array with $m$ rows and $n$ columns filled with symbols from an alphabet with $n$ symbols, such that each row contains a permutation of…

Combinatorics · Mathematics 2015-09-03 N. Astromujoff , M. Matamala

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

Given a partition $h_1+h_2+\dots+h_k = n$, a latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots ,h_k$ is called a realization. When the values $h_i$ are of at most two sizes, the existence of a realization has…

Combinatorics · Mathematics 2026-03-26 Tara Kemp , James G. Lefevre

We prove that for all n>1 every latin n-dimensional cube of order 5 has transversals. We find all 123 paratopy classes of layer-latin cubes of order 5 with no transversals. For each $n\geq 3$ and $q\geq 3$ we construct a (2q-2)-layer latin…

Combinatorics · Mathematics 2025-12-01 A. L. Perezhogin , V. N. Potapov , S. Yu. Vladimirov

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…

Combinatorics · Mathematics 2019-04-17 Carl Johan Casselgren , Lan Anh Pham

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

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…

Combinatorics · Mathematics 2013-06-04 Padraic Bartlett

Efficient Latin hypercube designs (LHDs), including maximin distance LHDs, maximum projection LHDs and orthogonal LHDs, are widely used in computer experiments. It is challenging to construct such designs with flexible sizes, especially for…

Methodology · Statistics 2021-01-12 Hongzhi Wang , Qian Xiao , Abhyuday Mandal

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

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…

Combinatorics · Mathematics 2026-05-28 Richard Bean , Nicholas Cavenagh

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

Let $m \leq n \leq k$. An $m \times n \times k$ 0-1 array is a Latin box if it contains exactly $mn$ ones, and has at most one $1$ in each line. As a special case, Latin boxes in which $m = n = k$ are equivalent to Latin squares. Let…

Combinatorics · Mathematics 2019-02-12 Zur Luria , Michael Simkin

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=2^k$ and $A$ is $3$-dimensional $n\times n\times…

Combinatorics · Mathematics 2018-09-10 Carl Johan Casselgren , Klas Markström , Lan Anh Pham

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

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…

Combinatorics · Mathematics 2016-04-05 Miguel G. Palomo

For an integer partition $h_1 + \dots + h_n = N$, a 2-realization of this partition is a latin square of order $N$ with disjoint subsquares of orders $h_1,\dots,h_n$. The existence of 2-realizations is a partially solved problem posed by…

Combinatorics · Mathematics 2025-01-16 Diane Donovan , Tara Kemp , James Lefevre
‹ Prev 1 2 3 10 Next ›