Related papers: Disjoint weighing matrices
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
A weighing matrix $W$ is quasi-balanced if $|W||W|^\top=|W|^\top|W|$ has at most two off-diagonal entries, where $|W|_{ij}=|W_{ij}|$. A quasi-balanced weighing matrix $W$ signs a strongly regular graph if $|W|$ coincides with its adjacency…
Design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structures are presented. These include techniques for designing non-separable multidimensional paraunitary matrices. Properties of the…
Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph…
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which…
We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as…
We show how to use formal desingularizations (defined earlier by the first author) in order to compute the global sections (also called adjoints) of twisted pluricanonical sheaves. These sections define maps that play an important role in…
Starting from involutive BE algebras, we redefine the orthomodular algebras, by introducing the notion of implicative-orthomodular algebras. We investigate properties of implicative-orthomodular algebras, and give characterizations of these…
The ensemble of antagonistic matrices is introduced and studied. In antagonistic matrices the entries $\mathcal A_{i,j}$ and $\mathcal A_{j,i}$ are real and have opposite signs, or are both zero, and the diagonal is zero. This…
We construct a weight matrix for the 3D Ising model satisfying the so-called twisted tetrahedron equation. The result is based on the theory of the n-simplicial complex and the invented recursion procedure on the space of n-simplex…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
The class of ordinary linear constant coefficient differential equations is naturally embedded into a wider class by associating differential equations to algebraic curves.
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
We introduce the triangulant of two matrices, and relate it to the existence of orthogonal eigenvectors. We also use it for a new characterization of mutually unbiased bases. Generalizing the notion, we introduce higher order triangulants…
A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
Three combinatorial matrices are considered and their LU-decompositions were found. This is typically done by (creative) guessing, and necessary proofs are more or less routine calculations.
For any sequence of matrix algebras that converge to a coadjoint orbit we give explicit formulas that show that the distances between the matrix algebras (viewed as quantum metric spaces) converges to 0. In the process we develop a general…