In this context, it is conceivable that the permutation matrices with maximum entangling power are related to sets of mutually orthogonal latin squares.
Entangling Power of Permutations
Hashimoto, The king’s problem with mutually unbiased bases and orthogonal Latin squares, quant-ph/0502092. A.
Entangling Power of Permutations
Mullen, Discrete mathematics using Latin squares, Wiley-Interscience Series in Discrete Mathematics and Optimization, A Wiley-Interscience Publication.
Entangling Power of Permutations
Apparently these papers had their starting point in the featuring of x–a.p. as by–product of a latin square problem (see more on this in [1, 2]).
On simultaneous arithmetic progressions on elliptic curves
Any ﬁnite group is uniquely determined by its multiplication table which in fact is a Latin square.
Remarks to Glazek's results on n-ary groups
In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism.
The Morphisms With Unstackable Image Words
In 2007 we extended Frid’s result to the use of the Latin-square structure to deﬁne our morphism structure .
The Morphisms With Unstackable Image Words
Noticing that this morphism was overlap-free put a hole in our attempt to classify all of the overlap-free morphisms using Latin square morphisms.
The Morphisms With Unstackable Image Words
It seemed to avoid a considerable number of the techniques used in the proof For the Latin square morphisms.
The Morphisms With Unstackable Image Words
As in the argument for a Latin square morphism to be overlap-free we will consider the word h(Z ) to be a line.
The Morphisms With Unstackable Image Words
Latin square thue-morse sequences are overlap-free.
The Morphisms With Unstackable Image Words
The order n of a quasigroup is deﬁned by the number of elements in Q . A quasigroup can be represented by an n × n -multiplication table, where for each pair a , b the table gives the result of a · b , and it deﬁnes a Latin square.
A Translational Approach to Constraint Answer Set Solving
This idea is due to Euler who gave a construction of a semimagic square (that is, a ( × [n] ∪ [n] × )-uniform n × n table) from a pair of special ( × [n] ∪ [n] × )-uniform matrices called Latin squares.
Generalized Semimagic Squares for Digital Halftoning
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case.
Random Latin square graphs
Given a group, one can obtain Latin squares by considering its multiplication table or its division table.
Random Latin square graphs
***