Orthogonal Latin squares: an application of experiment design to compiler testing

1985 ◽  
Vol 28 (10) ◽  
pp. 1054-1058 ◽  
Author(s):  
Robert Mandl
Keyword(s):  
Experiment Design ◽  
Latin Squares ◽  
Orthogonal Latin Squares ◽  
Compiler Testing

Low-Power, Resilient Interconnection with Orthogonal Latin Squares

2011 ◽  
Vol 28 (2) ◽  
pp. 30-39 ◽  
Author(s):  
Seung Eun Lee ◽  
Yoon Seok Yang ◽  
G S Choi ◽  
Wei Wu ◽  
R Iyer
Keyword(s):  
Low Power ◽  
Latin Squares ◽  
Orthogonal Latin Squares

Projective planes of infinite but isolic order

1976 ◽  
Vol 41 (2) ◽  
pp. 391-404 ◽  
Author(s):  
J. C. E. Dekker
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane ◽  
Projective Planes ◽  
Latin Squares ◽  
Combinatorial Theory ◽  
Ternary Ring ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Planar Ternary Ring ◽  
Partial Recursive Functions

The main purpose of this paper is to show how partial recursive functions and isols can be used to generalize the following three well-known theorems of combinatorial theory.(I) For every finite projective plane Π there is a unique number n such that Π has exactly n2 + n + 1 points and exactly n2 + n + 1 lines.(II) Every finite projective plane of order n can be coordinatized by a finite planar ternary ring of order n. Conversely, every finite planar ternary ring of order n coordinatizes a finite projective plane of order n.(III) There exists a finite projective plane of order n if and only if there exist n − 1 mutually orthogonal Latin squares of order n.

New bounds of Mutually unbiased maximally entangled bases in C^dxC^(kd)

2018 ◽  
Vol 18 (13&14) ◽  
pp. 1152-1164
Author(s):  
Xiaoya Cheng ◽  
Yun Shang
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Prime Power ◽  
Latin Squares ◽  
Mutually Unbiased Bases ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Bipartite System

Mutually unbiased bases which is also maximally entangled bases is called mutually unbiased maximally entangled bases (MUMEBs). We study the construction of MUMEBs in bipartite system. In detail, we construct 2(p^a-1) MUMEBs in \cd by properties of Guss sums for arbitrary odd d. It improves the known lower bound p^a-1 for odd d. Certainly, it also generalizes the lower bound 2(p^a-1) for d being a single prime power. Furthermore, we construct MUMEBs in \ckd for general k\geq 2 and odd d. We get the similar lower bounds as k,b are both single prime powers. Particularly, when k is a square number, by using mutually orthogonal Latin squares, we can construct more MUMEBs in \ckd, and obtain greater lower bounds than reducing the problem into prime power dimension in some cases.

A Partial Generalization of Mann's Theorem Concerning Orthogonal Latin Squares

1988 ◽  
Vol 31 (4) ◽  
pp. 409-413 ◽  
Author(s):  
E. T. Parker ◽  
Lawrence Somer
Keyword(s):  
Latin Square ◽  
Latin Squares ◽  
Necessary Condition ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Complete Set

AbstractLetn = 4t+- 2, where the integert ≧ 2. A necessary condition is given for a particular Latin squareLof ordernto have a complete set ofn — 2mutually orthogonal Latin squares, each orthogonal toL.This condition extends constraints due to Mann concerning the existence of a Latin square orthogonal to a given Latin square.

Sign in / Sign up

Export Citation Format

Share Document