Related papers: The main reasons for matrices multiplying to zero

Interesting physical results can be obtained from sigma models by taking the number of fields N to zero. I discuss how one can make sense of this limit by using exact S matrix techniques. I review how this can be done for the case of…

In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…

We consider the question of the boundedness of matrix products $A_{n}B_{n}\cdots A_{1}B_{1}$ with factors from two sets of matrices, $A_{i}\in\mathscr{A}$ and $B_{i}\in\mathscr{B}$, due to an appropriate choice of matrices $\{B_{i}\}$. It…

An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…

It is shown that the world-line can be eliminated in the matrix quantum mechanics conjectured by Banks, Fischler, Shenker and Susskind to describe the light-cone physics of M theory. The resulting matrix model has a form that suggests…

We consider a new class of non-self-adjoint matrices that arise from an indefinite self-adjoint linear pencil of matrices, and obtain the spectral asymptotics of the spectra as the size of the matrices diverges to infinity. We prove that…

We derive exponential tail inequalities for sums of random matrices with no dependence on the explicit matrix dimensions. These are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit…

We associate a complete intersection singularity to a graded matrix factorization of size two of a polynomial in three variables. We show that we get an inverse to the reduction of singularities considered by C.T.C.Wall. We study this for…

A Laplacian matrix is a square matrix whose row sums are zero. We study the limiting eigenvalue distribution of a Laplacian matrix formed by taking a random elliptic matrix and subtracting the diagonal matrix containing its row sums. Under…

In order to find a suitable expression of an arbitrary square matrix over an arbitrary finite commutative ring, we prove that every such a matrix is always representable as a sum of a potent matrix and a nilpotent matrix of order at most…

A quantitative form of the Nullity Theorem is presented, which establishes a linear relation between the singular values of the two submatrices involved in the theorem up to the first order. The theorem is then extended to function spaces…

When we speak about parametric programming, sensitivity analysis, or related topics, we usually mean the problem of studying specified perturbations of the data such that for a given optimization problem some optimality criterion remains…

Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called…

Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…

We use an extension of the diagrammatic rules in random matrix theory to evaluate spectral properties of finite and infinite products of large complex matrices and large hermitian matrices. The infinite product case allows us to define a…

In this review we summarise recent results for the complex eigenvalues and singular values of finite products of finite size random matrices, their correlation functions and asymptotic limits. The matrices in the product are taken from…

In this paper, we consider a general discrete-time spectral factorization problem for rational matrix-valued functions. We build on a recent result establishing existence of a spectral factor whose zeroes and poles lie in any pair of…

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is…

We introduce a new variant of zero forcing - signed zero forcing. The classical zero forcing number provides an upper bound on the maximum nullity of a matrix with a given graph (i.e. zero-nonzero pattern). Our new variant provides an…