1,412 research outputs found
Maximal partial Latin cubes
We prove that each maximal partial Latin cube must have more than 29.289% of its cells filled and show by construction that this is a nearly tight bound. We also prove upper and lower bounds on the number of cells containing a fixed symbol in maximal partial Latin cubes and hypercubes, and we use these bounds to determine for small orders n the numbers k for which there exists a maximal partial Latin cube of order n with exactly k entries. Finally, we prove that maximal partial Latin cubes of order n exist of each size from approximately half-full (n3/2 for even n ≥ 10 and (n3 + n)/2 for odd n ≥21) to completely full, except for when either precisely 1 or 2 cells are empty
Entanglement and quantum combinatorial designs
We introduce several classes of quantum combinatorial designs, namely quantum
Latin squares, cubes, hypercubes and a notion of orthogonality between them. A
further introduced notion, quantum orthogonal arrays, generalizes all previous
classes of designs. We show that mutually orthogonal quantum Latin arrangements
can be entangled in the same way than quantum states are entangled.
Furthermore, we show that such designs naturally define a remarkable class of
genuinely multipartite highly entangled states called -uniform, i.e.
multipartite pure states such that every reduction to parties is maximally
mixed. We derive infinitely many classes of mutually orthogonal quantum Latin
arrangements and quantum orthogonal arrays having an arbitrary large number of
columns. The corresponding multipartite -uniform states exhibit a high
persistency of entanglement, which makes them ideal candidates to develop
multipartite quantum information protocols.Comment: 14 pages, 3 figures. Comments are very welcome
On a class of discrete functions
We consider classes of functions which depend in a certain way on their variables. The relation between the number of H-functions of n variables of the k-valued logic and the number of n-dimensional Latin hypercubes of order k is found. We have shown how from an arbitrary Latin hypercube we can "construct" (present in table form) an H-function and vice versa - how every H-function can be represented as a Latin hypercube. We extend the concepts of H-function and Latin hypercube
A new and flexible method for constructing designs for computer experiments
We develop a new method for constructing "good" designs for computer
experiments. The method derives its power from its basic structure that builds
large designs using small designs. We specialize the method for the
construction of orthogonal Latin hypercubes and obtain many results along the
way. In terms of run sizes, the existence problem of orthogonal Latin
hypercubes is completely solved. We also present an explicit result showing how
large orthogonal Latin hypercubes can be constructed using small orthogonal
Latin hypercubes. Another appealing feature of our method is that it can easily
be adapted to construct other designs; we examine how to make use of the method
to construct nearly orthogonal and cascading Latin hypercubes.Comment: Published in at http://dx.doi.org/10.1214/09-AOS757 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
- …