In 1905 Hermann Minkowski introduced his theory of reduction of positive definite quadratic forms. Recently, Hans J. Zassenhaus has suggested that this theory can be applied to the problem of row ...

Available methods to randomize binary matrices with fixed row and column sums are computationally intensive and tend to generate matrix configurations with unequal frequency.

Abstract. In this paper, Let the matrix 𝐴 ∈ 𝐶𝑛×𝑛 with Ind (𝐴) = 𝑘, we first construct two bordered matrices based on [32], which gave a method for computing the null space of 𝐴𝑘 by applying ...