The origins of combinatorial design theory lie within recreational mathematics. With the work
of Fisher and Yates in the 1930s it began to take on the character of a serious academic …

We identify five selected open problems in the theory of quantum information, which are
rather simple to formulate, are well studied in the literature, but are technically not easy. As …

The negative solution to the famous problem of 36 officers of Euler implies that there are no
two orthogonal Latin squares of order six. We show that the problem has a solution …

We present the numbers of isotopy classes and main classes of Latin squares, and the
numbers of isomorphism classes of quasigroups and loops, up to order 10. The best …

Permutation arrays for powerline communication and mutually orthogonal latin squares Page 1
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 6, JUNE 2004 1289 On the …

Latin squares and mutually orthogonal sets of Latin squares (MOLS) have an old history
predating Euler's work in the late 1700s. With the emergence of the abstract concept of a …

Inspired by the array-structured superhydrophobic surface of natural lotus leaves, an array
structure was successfully constructed on the surface of AZ31B magnesium (Mg) alloys by a …

We identify five selected open problems in the theory of quantum information, which are
rather simple to formulate, were well-studied in the literature, but are technically not easy. As …

A k-independent set in a connected graph is a set of vertices such that any two vertices in
the set are at distance greater than k in the graph. The k-independence number of a graph …

The famous combinatorial problem of Euler concerns an arrangement of 36 officers from six
different regiments in a 6× 6 square array. Each regiment consists of six officers each …