Related papers: A three-factor product construction for mutually o…
In this paper, constructions of multimagic squares are investigated. Diagonal Latin squares and Kronecker products are used to get some constructions of multimagic squares. Consequently, some new families of compound multimagic squares are…
We investigate MacNeish's conjecture (known to be false in general) in the setting of what we call "transitive" Mutually Orthogonal Latin Squares (MOLS). When we restrict our attention to "simply transitive" MOLS, we find that the…
Two $n \times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$…
We offer a piece of evidence that the problems of finding the number of mutually unbiased bases (MUB) and mutually orthogonal Latin squares (MOLS) might not be equivalent. We study a particular procedure which has been shown to relate the…
We report the results of a computer investigation of sets of mutually orthogonal latin squares (MOLS) of small order. For $n\le9$ we 1. Determine the number of orthogonal mates for each species of latin square of order $n$. 2. Calculate the…
We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually orthogonal Latin squares and MOLR, namely that each Latin…
We prove that a Schur function of rectangular shape $(M^n)$ whose variables are specialized to $x_1,x_1^{-1},...,x_n,x_n^{-1}$ factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at…
Recent researches on designs for computer experiments with both qualitative and quantitative factors have advocated the use of marginally coupled designs. This paper proposes a general method of constructing such designs for which the…
An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
A classical theorem of MacMahon states that the number of lozenge tilings of any centrally symmetric hexagon drawn on the triangular lattice is given by a beautifully simple product formula. In this paper we present a counterpart of this…
A pair of orthogonal latin cubes of order $q$ is equivalent to an MDS code with distance $3$ or to an ${\rm OA}_1(3,5,q)$ orthogonal array. We construct pairs of orthogonal latin cubes for a sequence of previously unknown orders…
Orthogonal minimally aliased response surface (OMARS) designs permit the study of quantitative factors at three levels using an economical number of runs. In these designs, the linear effects of the factors are neither aliased with each…
We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by Cellular Automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local rule of diameter $d$ over an alphabet of $q$ elements…
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…
The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…
In this paper we construct Ricci-positive metrics on the connected sum of products of arbitrarily many spheres provided the dimensions of all but one sphere in each summand are at least 3. There are two new technical theorems required to…
We will see that every finite projective plane of order k > 1 gives rise to a complete set of (k-1) MPLS (= mutually projective latin squares) of order k and by reversing the process we can construct a finite projective plane of order k…
The component-wise or Schur product $C*C'$ of two linear error correcting codes $C$ and $C'$ over certain finite field is the linear code spanned by all component-wise products of a codeword in $C$ with a codeword in $C'$. When $C=C'$, we…
Motivated by viewing categories as bimodule monoids over their isomorphism groupoids, we construct monoidal structures called plethysm products on three levels: that is for bimodules, relative bimodules and factorizable bimodules. For the…