arXiv subjects
Publications and source records attributed to N. A. Balonin.
There are 20 odd integers v less than 200 for which the existence of Legendre pairs of length v is undecided. The smallest among them is v=77. We have constructed Legendre pairs of lengths 91, 93 and 123 reducing the number of undecided cases to 17.
We construct many symmetric Hadamard matrices of small order by using the so called propus construction. The necessary difference families are constructed by restricting the search to the families which admit a nontrivial multiplier. Our main result is that we have constructed, for the first time, symmetric Hadamard matrices of order 268, 412, 436 and 604.
We continue our systematic search for symmetric Hadamard matrices based on the so called propus construction. In a previous paper this search covered the orders $4v$ with odd $v\le41$. In this paper we cover the cases $v=43,45,47,49,51$. The odd integers $v<120$ for which no symmetric Hadamard matrices of order $4v$ are known are the following: $$47,59,65,67,73,81,89,93,101,103,107,109,113,119.$$ By using the propus construction, we found several symmetric Hadamard matrices of order $4v$ for $v=47,73,113$.
We systematically explore the new method of construction (known as the propus construction) of symmetric Hadamard matrices for small orders, $4v$. In particular we give the first examples of symmetric Hadamard matrices of order $156=4\cdot 39$. The smallest $v$ for which symmetric Hadamard matrices of order $4v$ are not known is now $v=47$.
\textit{Propus} (which means twins) is a construction method for orthogonal $\pm 1$ matrices based on a variation of the Williamson array called the \textit{propus array} \[ \begin{matrix*}[r] A& B & B & D B& D & -A &-B B& -A & -D & B D& -B & B &-A. \end{matrix*} \] This construction designed to find symmetric Hadamard matrices was originally based on circulant symmetric $\pm 1$ matrices, called \textit{propus matrices}. We also give another construction based on symmetric Williamson-type matrices. We give constructions to find symmetric propus-Hadamard matrices for 57 orders $4n$, $n < 200$ odd. We give variations of the above array to allow for more general matrices than symmetric Williamson propus matrices. One such is the \textit{ Generalized Propus Array (GP)}.
A $Cretan(4t+1)$ matrix, of order $4t+1$, is an orthogonal matrix whose elements have moduli $\leq 1$. The only $Cretan(4t+1)$ matrices previously published are for orders 5, 9, 13, 17 and 37. This paper gives infinitely many new $Cretan(4t+1)$ matrices constructed using $regular~Hadamard$ matrices, $SBIBD(4t+1,k,λ)$, weighing matrices, generalized Hadamard matrices and the Kronecker product. We introduce an inequality for the radius and give a construction for a Cretan matrix for every order $n \geq 3$.
Apart from the ordinary and the periodic Golay pairs, we define also the negaperiodic Golay pairs. (They occurred first, under a different name, in a paper of Ito.) If a Hadamard matrix is also a Toeplitz matrix, we show that it must be either cyclic or negacyclic. We investigate the construction of Hadamard (and weighing matrices) from two negacyclic blocks (2N-type). The Hadamard matrices of 2N-type are equivalent to negaperiodic Golay pairs. We show that the Turyn multiplication of Golay pairs extends to a more general multiplication: one can multiply Golay pairs of length $g$ and negaperiodic Golay pairs of length $v$ to obtain negaperiodic Golay pairs of length $gv$. We show that the Ito's conjecture about Hadamard matrices is equivalent to the conjecture that negaperiodic Golay pairs exist for all even lengths.
Cretan matrices are orthogonal matrices with elements $\leq 1$. These may have application in forming some new materials. There is a search for Cretan matrices, especially with high determinant, for all orders. These have been found by both mathematical and computational methods. This paper highlights the differences between theoretical and computational solutions to finding Cretan matrices. It has been shown that the incidence matrix of a symmetric balanced incomplete block design can be used to form Cretan($v;2$) matrices. We give families of Cretan matrices constructed using Hadamard related difference sets.
We study orthogonal matrices whose elements have moduli $\leq 1$. This paper shows that the existence of two such families of matrices is equivalent. Specifically we show that the existence of an Hadamard matrix of order $4t$ is equivalent to the existence of a Cretan$(4t-1,2)$-Mersenne matrix.