Mutually orthogonal binary frequency squares

DOI10.37236/9373MaRDI QIDQ782946zbMATH OpenOpenAlexFDO

Authors Thomas Britz, Nicholas J. Cavenagh, Adam Mammoliti, Ian M. Wanless

Publication date 29 July 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1912.08972

zbMATH Keywords

Hadamard matrixisomorphism classes

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Abstract: A emph{frequency square} is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only {em binary} frequency squares of order $n$ with $n/2$ zeroes and $n/2$ ones in each row and column. Two such frequency squares are emph{orthogonal} if, when superimposed, each of the 4 possible ordered pairs of entries occurs equally often. In this context we say that a $k$-MOFS$(n)$ is a set of $k$ binary frequency squares of order $n$ in which each pair of squares is orthogonal. A $k$-MOFS$(n)$ must satisfy $kle(n-1{)}^2$, and any MOFS achieving this bound are said to be emph{complete}. For any $n$ for which there exists a Hadamard matrix of order $n$ we show that there exists at least $2^{n^2/4-O(nlogn)}$ isomorphism classes of complete MOFS$(n)$. For $2<nequiv2pmod4$ we show that there exists a $17$-MOFS$(n)$ but no complete MOFS$(n)$. A $k$-maxMOFS$(n)$ is a $k$-MOFS$(n)$ that is not contained in any $(k+1)$-MOFS$(n)$. By computer enumeration, we establish that there exists a $k$-maxMOFS$(6)$ if and only if $kin1,17$ or $5lekle15$. We show that up to isomorphism there is a unique $1$-maxMOFS$(n)$ if $nequiv2pmod4$, whereas no $1$-maxMOFS$(n)$ exists for $nequiv0pmod4$. We also prove that there exists a $5$-maxMOFS$(n)$ for each order $nequiv2pmod4$ where $ngeq6$.

Review text

Summary: A frequency square is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only binary frequency squares of order \(n\) with \(n/2\) zeros and \(n/2\) ones in each row and column. Two such frequency squares are orthogonal if, when superimposed, each of the 4 possible ordered pairs of entries occurs equally often. In this context we say that a set of \(k\text{-MOFS}(n)\) is a set of \(k\) binary frequency squares of order \(n\) in which each pair of squares is orthogonal. A set of \(k\text{-MOFS}(n)\) must satisfy \(k\le(n-1)^2\), and any set of MOFS achieving this bound is said to be complete. For any \(n\) for which there exists a Hadamard matrix of order \(n\) we show that there exists at least \(2^{n^2/4-O(n\log n)}\) isomorphism classes of complete sets of \(\text{MOFS}(n)\). For \(2<n\equiv2\pmod4\) we show that there exists a set of \(17\text{-MOFS}(n)\) but no complete set of \(\text{MOFS}(n)\). A set of \(k\text{-maxMOFS}(n)\) is a set of \(k\)-MOFS \((n)\) that is not contained in any set of \((k+1)\text{-MOFS}(n)\). By computer enumeration, we establish that there exists a set of \(k\text{-maxMOFS} (6)\) if and only if \(k\in\{1,17\}\) or \(5\le k\le 15\). We show that up to isomorphism there is a unique \(1\text{-maxMOFS}(n)\) if \(n\equiv2\pmod4\), whereas no \(1\text{-maxMOFS}(n)\) exists for \(n\equiv0\pmod4\). We also prove that there exists a set of \(5\text{-maxMOFS}(n)\) for each order \(n\equiv 2\pmod{4}\) where \(n\geq 6\).

Recommendations

• Maximal sets of mutually orthogonal frequency squares
• A construction method for complete sets of mutually orthogonal frequency squares
• Mutually orthogonal frequency rectangles
• The geometry of frequency squares
• scientific article; zbMATH DE number 36686

Cites work

• A coding theoretic solution to the 36 officer problem
• A short proof of the nonexistence of a pair of orthogonal Latin squares of order six
• Bounds for permutation arrays
• Enumerating extensions of mutually orthogonal Latin squares
• Frequency squares and affine designs
• Further contributions to the theory of F-squares design
• Group divisible designs in MOLS of order ten
• scientific article; zbMATH DE number 2128109 (Why is no real title available?)
• scientific article; zbMATH DE number 3702676 (Why is no real title available?)
• scientific article; zbMATH DE number 2187682 (Why is no real title available?)
• Latin squares with no transversals
• Latin squares without orthogonal mates
• Monogamous latin squares
• On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects
• On the existence and construction of a complete set of orthogonal F(4t; 2t, 2t)-squares design
• Some new results on mutually orthogonal frequency squares
• The CRC handbook of combinatorial designs
• The existence of Latin squares without orthogonal mates
• The geometry of frequency squares
• The theory and application of latin bitrades: A survey

Cited in

(10)

• A construction method for complete sets of mutually orthogonal frequency squares
• Maximal sets of mutually orthogonal frequency squares
• Row-column factorial designs with strength at least 2
• Some new results on mutually orthogonal frequency squares
• A new representation of mutually orthogonal frequency squares
• scientific article; zbMATH DE number 2187682 (Why is no real title available?)
• Mutually orthogonal frequency rectangles
• Row‐column factorial designs with multiple levels
• Mutually orthogonal binary frequency squares of mixed type
• Maximal sets of mutually orthogonal frequency squares and Doehlert-Klee designs

This page was built for publication: Mutually orthogonal binary frequency squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782946)