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.

A general construction of mutually orthogonal latin squares of prime order

2018 ◽  
Vol 7 (1-2) ◽  
pp. 77-93
Author(s):  
J. A. Saka ◽  
O. O. Oyadare
Keyword(s):  
Structural Properties ◽  
Generating Function ◽  
Generating Functions ◽  
Prime Order ◽  
Latin Squares ◽  
General Construction ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Complete Set ◽  
General Method

This paper presents a general method of constructing a complete set of Mutually Orthogonal Latin Squares (MOLS) of the order of any prime, via the use of generating functions dened on the nite eld of this order. Apart from using the generating function to get a complete set of Mutually Orthogonal Latin Squares, the studies of the generating functions opens up the possibility of getting at the deep structural properties of MOLS. Copious examples were given for detailed illustrations.

scholarly journals On the Structure and Classification of SOMAs: Generalizations of Mutually Orthogonal Latin Squares

10.37236/1464 ◽  
1999 ◽  
Vol 6 (1) ◽  
Author(s):  
Leonard H. Soicher
Keyword(s):  
Graph Theory ◽  
Group Theory ◽  
Pairwise Disjoint ◽  
Latin Square ◽  
Latin Squares ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Computational Group Theory

Let $k\ge0$ and $n\ge2$ be integers. A SOMA, or more specifically a SOMA$(k,n)$, is an $n\times n$ array $A$, whose entries are $k$-subsets of a $kn$-set $\Omega$, such that each element of $\Omega$ occurs exactly once in each row and exactly once in each column of $A$, and no 2-subset of $\Omega$ is contained in more than one entry of $A$. A SOMA$(k,n)$ can be constructed by superposing $k$ mutually orthogonal Latin squares of order $n$ with pairwise disjoint symbol-sets, and so a SOMA$(k,n)$ can be seen as a generalization of $k$ mutually orthogonal Latin squares of order $n$. In this paper we first study the structure of SOMAs, concentrating on how SOMAs can decompose. We then report on the use of computational group theory and graph theory in the discovery and classification of SOMAs. In particular, we discover and classify SOMA$(3,10)$s with certain properties, and discover two SOMA$(4,14)$s (SOMAs with these parameters were previously unknown to exist). Some of the newly discovered SOMA$(3,10)$s come from superposing a Latin square of order 10 on a SOMA$(2,10)$.

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.

scholarly journals On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares

Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1895 ◽  
Author(s):  
M. Higazy ◽  
A. El-Mesady ◽  
M. S. Mohamed
Keyword(s):  
Computer Science ◽  
Finite Fields ◽  
Orthogonal Array ◽  
Orthogonal Arrays ◽  
Latin Squares ◽  
Error Correcting Codes ◽  
Recursive Construction ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Definition Of

During the last two centuries, after the question asked by Euler concerning mutually orthogonal Latin squares (MOLS), essential advances have been made. MOLS are considered as a construction tool for orthogonal arrays. Although Latin squares have numerous helpful properties, for some factual applications these structures are excessively prohibitive. The more general concepts of graph squares and mutually orthogonal graph squares (MOGS) offer more flexibility. MOGS generalize MOLS in an interesting way. As such, the topic is attractive. Orthogonal arrays are essential in statistics and are related to finite fields, geometry, combinatorics and error-correcting codes. Furthermore, they are used in cryptography and computer science. In this paper, our current efforts have concentrated on the definition of the graph-orthogonal arrays and on proving that if there are k MOGS of order n, then there is a graph-orthogonal array, and we denote this array by G-OA(n2,k,n,2). In addition, several new results for the orthogonal arrays obtained from the MOGS are given. Furthermore, we introduce a recursive construction method for constructing the graph-orthogonal arrays.

Sign in / Sign up

Export Citation Format

Share Document