I'm looking for a method to construct a pair of two MOLS of even side 4n, n > 2. Is there a method for this, preferably one that is simple to implement? I believe this book to contain a simple construction in ch.4, but I do not have access to this resource.
2026-03-25 23:16:03.1774480563
Constructing MOLS
1.1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in LATIN-SQUARE
- Find two different latin squares of order $5$
- Problem 2.2 from Jukna's "Extremal Combinatorics"
- Let $L$ be a latin square whose entries are $L_{ij} = i+j (mod n)$. Then there are no $n$ distinct entries from unique rows and columns of $L$
- Question from the British Mathematical Olympiad
- Orthogonal $4x4$ Latin Squares
- Latin square design for a social "mixer"
- How many ways to colour a $4 \times 4$ grid using four colours subject to three constraints
- Proving a binary operation is not associative given a latin square
- What is a Latin Square?
- How-to leverage two unique orderings for a list to produce a single unique ordering for that list?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
A recipe for finding a pair of mutually orthogonal latin squares (MOLS) of order $4n$ can be framed in terms that MacNeish presented in 1922.
First factor $4n$ into its prime power factors: $2^{k_1}...p^{k_m}$. By assumption $k_1 > 1$ because the factor $4$ (at least) appears in our order.
Next produce a pair of MOLS for each prime power factor, using the existence of a finite field of that order to produce at least two such. Note that the construction grants us $p^k - 1$ MOLS of order $p^k$, which is the most possible. It is a famous open problem whether $n-1$ MOLS of order $n$ exist for any orders that are not prime powers.
Finally combine the corresponding mutually orthogonal pairs of latin squares of respective prime power orders into two latin squares of order $4n$ by applying the "direct product" construction described by MacNeish (and possibly known earlier to Euler; he was a pretty bright guy). That is, suppose $L$ is a latin square of order $l$ and $M$ a latin square of order $m$. Construct a square $P$ of order $lm$ simply by pairing the symbol $u \in \{1,..,l\}$ in $L_{i,j}$ and the symbol $v \in \{1,..,m\}$ in $M_{r,s}$ and placing this combined symbol (as arithmetically encoded ordered pair) in $P_{i+l(r-1),j+l(s-1)}$:
$$(u,v) \rightarrow u + l(v-1) $$
If this "direct product" construction be performed with MOLS $L_1$ and $L_2$ of order $l$ and respective MOLS $M_1$ and $M_2$ of order $m$, the two results $P_1$ and $P_2$ will be an orthogonal pair of latin squares of order $lm$. The proof of this does not require any condition on coprimality of factor $l,m$. One needs only to verify that the arithmetic encoding preserves distinction of both symbols in the ordered pair.
The importance of having the exponent of $2$ greater than $1$ is that if only a single factor of $2$ is present, the construction is stuck because (trivially) there do not exist a pair of MOLS of order $2$. On the other hand if we apply the recipe above with no factors of $2$ (i.e. to odd orders), it will always work because the family of odd prime power $p^k$ order MOLS provides at least two.
Added: There's a shortcut to produce just a pair of MOLS of odd order, and since that's all we need, it's attractive for producing the required components. For the powers of two we can get by with pre-constructing pairs of MOLS of orders four and eight, and then combining them as above using the "direct product" construction.