Quadratic permutations, complete mappings and mutually orthogonal latin squares

2017 ◽  
Vol 67 (5) ◽  
Author(s):  
Simona Samardjiska ◽  
Danilo Gligoroski
Keyword(s):  
Finite Field ◽  
Special Class ◽  
Latin Squares ◽  
Bent Functions ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Characteristic 2 ◽  
Complete Mappings

AbstractWe investigate the permutation behavior of a special class of Dembowski-Ostrom polynomials over a finite field of characteristic 2 of the formOne of the newly identified classes contains a subclass of complete mappings. We use these complete mappings to define new sets of mutually orthogonal Latin squares, as well as new vectorial bent functions from the Maiorana-McFarland class. Moreover, the quasigroup polynomials obtained in the process are different and inequivalent to the previously known ones.

scholarly journals The number of permutation polynomials of the form f(x) cx over a finite field

1995 ◽  
Vol 38 (1) ◽  
pp. 133-149 ◽  
Author(s):  
Daqing Wan ◽  
Gary L. Mullen ◽  
Peter Jau-Shyong Shiue
Keyword(s):  
Finite Field ◽  
Residue Class ◽  
Projective Planes ◽  
Latin Squares ◽  
Permutation Polynomial ◽  
Permutation Polynomials ◽  
Translation Planes ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Mild Assumption

Let Fq be the finite field of q elements. Let f(x) be a polynomial of degree d over Fq and let r be the least non-negative residue of q-1 modulo d. Under a mild assumption, we show that there are at most r values of c∈Fq, such that f(x) + cx is a permutation polynomial over Fq. This indicates that the number of permutation polynomials of the form f(x) +cx depends on the residue class of q–1 modulo d.As an application we apply our results to the construction of various maximal sets of mutually orthogonal latin squares. In particular for odd q = pn if τ(n) denotes the number of positive divisors of n, we show how to construct τ(n) nonisomorphic complete sets of orthogonal squares of order q, and hence τ(n) nonisomorphic projective planes of order q. We also provide a construction for translation planes of order q without the use of a right quasifield.

Partial λ-Geometries and Generalized Hadamard Matrices Over Groups

1979 ◽  
Vol 31 (3) ◽  
pp. 617-627 ◽  
Author(s):  
David A. Drake
Keyword(s):  
Existence Theorem ◽  
Hadamard Matrices ◽  
Natural Generalization ◽  
Latin Squares ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Transversal Designs ◽  
Complete Mappings

Section 1 of this paper contains all the work which deals exclusively with generalizations of Hadamard matrices. The non-existence theorem proven here (Theorem 1.10) generalizes a theorem of Hall and Paige [15] on the non-existence of complete mappings in certain groups.In Sections 2 and 3, we consider the duals of (Hanani) transversal designs; these dual structures, which we call (s, r, µ)-nets, are a natural generalization of the much studied (Bruck) nets which in turn are equivalent to sets of mutually orthogonal Latin squares. An (s, r, µ)-net is a set of s2µ points together with r parallel classes of blocks. Each class consists of s blocks of equal cardinality. Two non-parallel blocks meet in precisely µ points. It has been proven that r is always less than or equal to (s2µ – l) / (s – 1).

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.

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