Related papers: Circulant conference matrices for new complex Hada…
Given polynomials a(z) of degree m and b(z) of degree n, we represent the inverse to the Sylvester resultant matrix of a(z) and b(z), if this inverse exists, as a canonical sum of m+n dyadic matrices each of which is a rational function of…
An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…
We give a new characterization of skew Hadamard matrices of size $n$ in terms of the data of the spectra of tournaments of size $n-2$.
We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are…
A new, two-parameter, nonaffine family of complex Hadamard matrices of order 6 is reported. It interpolates between the two Fourier families, and contains as one-parameter subfamilies the Dita family, a symmetric family and an almost (up to…
We construct an explicit family of modular iterated integrals which involves cusp forms. This leads to a new method of producing "invariant versions" of iterated integrals of modular forms. The construction will be based on an extension of…
This work developed novel complex matrix factorization methods for face recognition; the methods were complex matrix factorization (CMF), sparse complex matrix factorization (SpaCMF), and graph complex matrix factorization (GraCMF). After…
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…
This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of…
We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…
Exact diagonalization and other numerical studies of quantum spin systems are notoriously limited by the exponential growth of the Hilbert space dimension with system size. A common and well-known practice to reduce this increasing…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
For the diagonalization of the Hamilton matrix in the Heisenberg model relevant dimensions are determined depending on the applicable symmetries. Results are presented, both, by general formulae in closed form and by the respective numbers…
In this article, we introduce the adapted inverse iteration method to generate bicomplex Julia sets associated to the polynomial map $w^2+c$. The result is based on a full characterization of bicomplex Julia sets as the boundary of a…
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
Recently, the supersymmetry method was extended from Gaussian ensembles to arbitrary unitarily invariant matrix ensembles by generalizing the Hubbard-Stratonovich transformation. Here, we complete this extension by including arbitrary…
Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…
We show how to efficiently compute Hilbert modular forms as orthogonal modular forms, generalizing and expanding upon the method of Birch.
In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…