Related papers: Latin squares with non-partitioning disjoint subsq…

In 1974 Allan Cruse provided necessary and sufficient conditions to extend an $r\times s$ partial latin rectangle consisting of $t$ distinct symbols to a latin square of order $n$. Here we provide some generalizations and consequences of…

A rationality condition is derived for the existence of odd perfect numbers involving the square root of a product, which consists of a sequence of repunits, multiplied by twice the base of one of the repunits. This constraint also provides…

Difference arrays are used in applications such as software testing, authentication codes and data compression. Pseudo-orthogonal Latin squares are used in experimental designs. A special class of pseudo-orthogonal Latin squares are the…

Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…

We establish necessary and sufficient conditions for the existence of an LU factorization $A=LU$ for an arbitrary square matrix $A$, including singular and rank-deficient cases, without the use of row or column permutations. We prove that…

Our purpose is to determine the complete set of mutually orthogonal squares of order $d$, which are not necessary Latin. In this article, we introduce the concept of supersquare of order $d$, which is defined with the help of its generating…

We will show that there are at least 8, 10 and 9 mutually orthogonal Latin squares (MOLS) of orders $n=54$, $96$ and $108$. The cases $n=54$ and $96$ are obtained by constructing separable permutation codes consisting of $8 \times 54$ and…

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

This paper is concerned with the problem of finding two sets of integers, $\{a_1, a_2, \ldots$, $a_m\}$ and $\{b_1, b_2, \ldots, b_n\}$, such that all the $mn$ sums $a_i+b_j, i=1, \ldots, m, j=1, \ldots, n$, are perfect squares. A method is…

In this paper we study collections of mutually nearly orthogonal Latin squares ($\text{MNOLS}$), which come from a modification of the orthogonal condition for mutually orthogonal Latin squares. In particular, we find the maximum $\mu$ such…

For any two n-th order polynomials a(s) and b(s), the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictly positive real.

We establish partition regularity of the generalised Pythagorean equation in five or more variables. Furthermore, we show how Rado's characterisation of a partition regular equation remains valid over the set of positive $k$th powers,…

There exists a bijection between the set of Latin squares of order $n$ and the set of feasible solutions of the 3-dimensional planar assignment problem ($3PAP_n$). In this paper, we prove that, given a Latin square isotopism $\Theta$, we…

An $n\times n\times\dots\times n$ hypercube is made from $n^d$ unit hypercubes. Two unit hypercubes are neighbours if they share a $(d-1)$-dimensional face. In each step of a dismantling process, we remove a unit hypercube that has…

We use heuristic algorithms to find terraces for small groups. We show that Bailey's Conjecture (that all groups other than the non-cyclic elementary abelian 2-groups are terraced) holds up to order 511, except possibly at orders 256 and…

We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (k,s)-nets (which can…

The mean king's problem with maximal mutually unbiased bases (MUB's) in general dimension d is investigated. It is shown that a solution of the problem exists if and only if the maximal number (d+1) of orthogonal Latin squares exists. This…

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

We prove that if a linear equation, whose coefficients are continuous rational functions on a nonsingular real algebraic surface, has a continuous solution, then it also has a continuous rational solution. This is known to fail in higher…

A perfect $1$-factorisation of a graph is a decomposition of that graph into $1$-factors such that the union of any two $1$-factors is a Hamiltonian cycle. A Latin square of order $n$ is row-Hamiltonian if for every pair $(r,s)$ of distinct…