1,082 research outputs found
Difference Covering Arrays and Pseudo-Orthogonal Latin Squares
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 mutually nearly orthogonal Latin squares (MNOLS) first
discussed in 2002, with general constructions given in 2007. In this paper we
develop row complete MNOLS from difference covering arrays. We will use this
connection to settle the spectrum question for sets of 3 mutually
pseudo-orthogonal Latin squares of even order, for all but the order 146
Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices
Absolutely Maximally Entangled (AME) states are those multipartite quantum
states that carry absolute maximum entanglement in all possible partitions. AME
states are known to play a relevant role in multipartite teleportation, in
quantum secret sharing and they provide the basis novel tensor networks related
to holography. We present alternative constructions of AME states and show
their link with combinatorial designs. We also analyze a key property of AME,
namely their relation to tensors that can be understood as unitary
transformations in every of its bi-partitions. We call this property
multi-unitarity.Comment: 18 pages, 2 figures. Comments are very welcom
Computing random -orthogonal Latin squares
Two Latin squares of order are -orthogonal if, when superimposed,
there are exactly distinct ordered pairs. The spectrum of all values of
for Latin squares of order is known. A Latin square of order is
-self-orthogonal if and its transpose are -orthogonal. The spectrum
of all values of is known for all orders . We develop randomized
algorithms for computing pairs of -orthogonal Latin squares of order and
algorithms for computing -self-orthogonal Latin squares of order
Structure of the sets of mutually unbiased bases with cyclic symmetry
Mutually unbiased bases that can be cyclically generated by a single unitary
operator are of special interest, since they can be readily implemented in
practice. We show that, for a system of qubits, finding such a generator can be
cast as the problem of finding a symmetric matrix over the field
equipped with an irreducible characteristic polynomial of a given Fibonacci
index. The entanglement structure of the resulting complete sets is determined
by two additive matrices of the same size.Comment: 20 page
Computing the sets of totally symmetric and totally conjugate orthogonal partial Latin squares by means of a SAT solver
Conjugacy and orthogonality of Latin squares have been widely studied in the literature not only for their theoretical interest in combinatorics, but also for their applications in distinct fields as experimental design, cryptography or code theory, amongst others. This paper deals with a series of binary constraints that characterize the sets of partial Latin squares of a given order for which their six conjugates either coincide or are all of them distinct and pairwise orthogonal. These constraints enable us to make use of a SAT solver to enumerate both sets. As an illustrative application, it is also exposed a method to construct totally symmetric partial Latin squares that gives rise,
under certain conditions, to new families of Lie partial quasigroup rings
- …