Mutually orthogonal binary frequency squares

DOI10.37236/9373zbMATH Open1444.05031arXiv1912.08972OpenAlexW2996688016MaRDI QIDQ782946FDOQ782946

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)

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$.

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

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

zbMATH Keywords

Hadamard matrixisomorphism classes

Mathematics Subject Classification ID

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

Cites Work

• The CRC handbook of combinatorial designs
• The theory and application of latin bitrades: A survey
• Title not available (Why is that?)
• Bounds for permutation arrays
• Monogamous latin squares
• Latin squares without orthogonal mates
• The existence of Latin squares without orthogonal mates
• Further contributions to the theory of F-squares design
• Title not available (Why is that?)
• Some new results on mutually orthogonal frequency squares
• Title not available (Why is that?)
• A short proof of the nonexistence of a pair of orthogonal Latin squares of order six
• Enumerating extensions of mutually orthogonal 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
• A coding theoretic solution to the 36 officer problem
• Frequency squares and affine designs
• Latin squares with no transversals
• Group divisible designs in MOLS of order ten
• The geometry of frequency squares

Cited In (8)

• Some new results on mutually orthogonal frequency squares
• Row‐column factorial designs with multiple levels
• Row-column factorial designs with strength at least 2
• Mutually orthogonal binary frequency squares of mixed type
• Maximal sets of mutually orthogonal frequency squares
• Mutually orthogonal frequency rectangles
• A new representation of mutually orthogonal frequency squares
• Title not available (Why is that?)

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)