Maximal sets of mutually orthogonal frequency squares
Nicholas J. Cavenagh, Adam Mammoliti, Ian M. Wanless

TL;DR
This paper investigates the maximal size of mutually orthogonal frequency squares, extending known results, establishing new bounds, and constructing infinite families of such squares with specific properties.
Contribution
It extends previous bounds on the maximal number of mutually orthogonal frequency squares and provides new constructions for infinite families with fixed cardinality.
Findings
For even n, μ(n) > 2 when n/2 is even.
Existence of sets of k-maxMOFS under divisibility conditions on n.
Infinite families of maximal binary MOFS with fixed size.
Abstract
A frequency square is a square matrix in which each row and column is a permutation of the same multiset of symbols. A frequency square is of type if it contains symbols, each of which occurs times per row and times per column. In the case when we refer to the frequency square as binary. A set of -MOFS is a set of frequency squares of type such that when any two of the frequency squares are superimposed, each possible ordered pair occurs equally often. A set of -maxMOFS is a set of -MOFS that is not contained in any set of -MOFS. For even , let be the smallest such that there exists a set of -maxMOFS. It was shown in [Electron. J. Combin. 27(3) (2020), P3.7] that if is odd and if …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
