Abstract
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-MOFS(n) is a set of k binary frequency squares of order n in which each pair of squares is orthogonal.
| Original language | English |
|---|---|
| Article number | P3.7 |
| Pages (from-to) | 1-26 |
| Number of pages | 26 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 27 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 10 Jul 2020 |
Projects
- 1 Finished
-
Matchings in Combinatorial Structures
Wanless, I. (Primary Chief Investigator (PCI)), Bryant, D. (Chief Investigator (CI)) & Horsley, D. (Chief Investigator (CI))
ARC - Australian Research Council, Monash University, University of Queensland , University of Melbourne
1/01/15 → 10/10/20
Project: Research
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver