Enumeration of Sets of Mutually Orthogonal Latin Rectangles

10/07/2019
by   Gerold Jäger, et al.
0

We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually orthogonal Latin squares and MOLR, namely that each Latin rectangle in a set of MOLR is isotopic to each other rectangle in the set. We call such a set of MOLR homogeneous. In the course of doing this, we perform a complete enumeration of non-isotopic sets of t mutually orthogonal k× n Latin rectangles for k≤ n ≤ 7, for all t < n. Specifically, we keep track of homogeneous sets of MOLR, as well as sets of MOLR where the autotopism group acts transitively on the rectangles, and we call such sets of MOLR transitive. We build the sets of MOLR row by row, and in this process we also keep track of which of the MOLR are homogeneous and/or transitive in each step of the construction process. We use the prefix stepwise to refer to sets of MOLR with this property. Sets of MOLR are connected to other discrete objects, notably finite geometries and certain regular graphs. Here we observe that all projective planes of order at most 9 except the Hughes plane can be constructed from a stepwise transitive MOLR.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2018

Triples of Orthogonal Latin and Youden Rectangles For Small Orders

We have performed a complete enumeration of non-isotopic triples of mutu...
research
06/19/2019

Mutually Orthogonal Latin Squares based on Cellular Automata

We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generate...
research
02/14/2023

Consistent estimation with the use of orthogonal projections for a linear regression model with errors in the variables

In this paper, we construct an estimator of an errors-in-variables linea...
research
08/19/2020

Uniform semi-Latin squares and their pairwise-variance aberrations

For integers n>2 and k>0, an (n× n)/k semi-Latin square is an n× n array...
research
03/09/2021

One-Sided k-Orthogonal Matrices Over Finite Semi-Local Rings And Their Codes

Let R be a finite commutative ring with unity 1_R and k ∈ R. Properties ...
research
02/08/2022

New results on vectorial dual-bent functions and partial difference sets

Bent functions f: V_n→𝔽_p with certain additional properties play an imp...
research
03/03/2018

Path Puzzles: Discrete Tomography with a Path Constraint is Hard

We prove that path puzzles with complete row and column information--or ...

Please sign up or login with your details

Forgot password? Click here to reset