A maximal $(+1, -1)$-matrix of order 66 is constructed by a method of matching two finite sequences. This method also produced many new designs for maximal $(+1, -1 ...
Mathematicians love a good puzzle. Even something as abstract as multiplying matrices (two-dimensional tables of numbers) can feel like a game when you try to find the most efficient way to do it.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback