Related papers: Almost Hadamard matrices with complex entries
This note is concerned in so called harmonic complex structures introduced by the author previously. I will recall some previous results and emphasize the motivation: Provide an attempt to a fundamental problem in geometry--determining the…
In this paper, we prove the conjecture posed by Keller and Rosemarin at Eurocrypt 2021 on the nullity of a matrix polynomial of a block matrix with Hadamard type blocks over commutative rings of characteristic 2. Therefore, it confirms the…
We discuss a conjecture of Donaldson on a version of Yau's Theorem for symplectic forms with compatible almost complex structures and survey some recent progress on this problem. We also speculate on some future possible directions, and use…
Matrix interpretations generalize linear polynomial interpretations and have been proved useful in the implementation of tools for automatically proving termination of Term Rewriting Systems. In view of the successful use of rational…
We introduce a construction that, given a pair (u,v) of complex Hadamard matrices of the same order, generates infinitely many biunitary matrices of varying (and distinct) orders. As a key application, this framework yields nested sequences…
In this paper we introduce modular symmetric designs and use them to study the existence of Hadamard matrices modulo 5. We prove that there exist 5-modular Hadamard matrices of order n if and only if n != 3, 7 (mod 10) or n != 6, 11. In…
A modeling methodology and matrix formalism is presented that permits analysis of arbitrarily complex interferometric waveguide systems, including polarization and backreflection effects. Considerable improvement results from separation of…
The fact that each finite-dimensional algebra over a field is isomorphic to the centralizer of two matrices, has suggested to investigate representation theoretical problems of finite-dimensional algebras through centralizer algebras of…
We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial…
We investigate the problem of counting the real or complex Hadamard matrices which are circulant, by using analytic methods. Our main observation is the fact that for $|q_0|=...=|q_{N-1}|=1$ the quantity…
Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…
In this text we review a few structural properties of matrix models that should at least partly generalize to random tensor models. We review some aspects of the loop equations for matrix models and their algebraic counterpart for tensor…
The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…
We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…
We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…
A recognized trend of research investigates generalizations of the Hadamard's inversion theorem to functions that may fail to be differentiable. In this vein, the present paper explores some consequences of a recent result about the…
For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…
The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…
We give a simple proof of why there is a Matrix theory approximation for a membrane shaped like an arbitrary Riemann surface. As corollaries, we show that noncompact membranes cannot be approximated by matrices and that the Poisson algebra…
Complex Hadamard matrices (CHMs) are intimately related to the number of distinct matrix elements. We investigate CHMs containing exactly three distinct elements, which is also the least number of distinct elements. In this paper, we show…