
PseudoHadamard matrices of the first generation and an algorithm for producing them
Hadamard matrices in {0,1} presentation are square m× m matrices whose e...
read it

Simultaneous hollowisation, joint numerical range, and stabilization by noise
We consider orthogonal transformations of arbitrary square matrices to a...
read it

Surjectivity of near square random matrices
We show that a nearly square iid random integral matrix is surjective ov...
read it

Convolutional Imputation of Matrix Networks
A matrix network is a family of matrices, where the relationship between...
read it

Generators and Relations for the Group O_n(ℤ[1/2])
We give a finite presentation by generators and relations for the group ...
read it

Multiplying Matrices Without Multiplying
Multiplying matrices is among the most fundamental and computeintensive...
read it

Bohemian Upper Hessenberg Matrices
We look at Bohemian matrices, specifically those with entries from {1, ...
read it
Hadamard matrices in {0,1} presentation and an algorithm for generating them
Hadamard matrices are square n× n matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in R^n. Each Hadamard matrix can be transformed to a matrix whose entries are zeros and ones. This presentation of Hadamard matrices is investigated in the paper and based on it an algorithm for generating them is designed.
READ FULL TEXT
Comments
There are no comments yet.