Related papers: Nonnegative Biquadratic Tensors

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…

We lay the geometric foundations for the study of the characteristic polynomial of tensors. For symmetric tensors of order $d \geq 3$ and dimension $2$ and symmetric tensors of order $3$ and dimension $3$, we prove that only finitely many…

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…

Anisotropic invariants play an important role in continuum mechanics. Knowing the number of independent invariants is crucial in modelling and in a rigorous construction of a constitutive equation for a particular material, where it is…

The probability that all eigenvalues of a product of $m$ independent $N \times N$ sub-blocks of a Haar distributed random real orthogonal matrix of size $(L_i+N) \times (L_i+N)$, $(i=1,\dots,m)$ are real is calculated as a multi-dimensional…

Let $F$ be a field, char$(F)\neq 2$. Then every finite-dimensional $F$-algebra has either an idempotent or an absolute nilpotent if and only if over $F$ every polynomial of odd degree has a root in $F$. This is also necessary and sufficient…

A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, we first give the necessary and sufficient conditions for a…

Real eigenpairs of a real antisymmetric tensor of order $p$ and dimension $N$ can be defined as pairs of a real eigenvalue and $p$ orthonormal $N$-dimensional real eigenvectors. We compute the signed and the genuine distributions of such…

Geometrically, the eigenvectors of a square matrix $\mathbf{A}$ are not rotated by $\mathbf{A}$. Here we consider vectors that are rotated $\pi/2$ by $\mathbf{A}$; that is, vectors orthogonal to their images. We call these vectors…

Completely positive graphs have been employed to associate with completely positive matrices for characterizing the intrinsic zero patterns. As tensors have been widely recognized as a higher-order extension of matrices, the…

The Minkowski tensors are valuations on the space of convex bodies in ${\mathbb R}^n$ with values in a space of symmetric tensors, having additional covariance and continuity properties. They are extensions of the intrinsic volumes, and as…

Let $G=C_n\oplus C_{mn}$ with $n\geq 2$ and $m\geq 1$, and let $k\in [0,n-1]$. It is known that any sequence of $mn+n-1+k$ terms from $G$ must contain a nontrivial zero-sum of length at most $mn+n-1-k$. The associated inverse question is to…

The main of this work is to use the unit lower triangular matrices for solving inverse eigenvalue problem of nonnegative matrices and present the easier method to solve this problem.

Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…

The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation…

Given a non-hermitean matrix M, the structure of its minimal polynomial encodes whether M is diagonalizable or not. This note will explain how to determine the minimal polynomial of a matrix without going through its characteristic…

In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which…

We prove a conjecture about the minimal nonnegative solutions of algebraic Riccati equations associated with reducible singular M-matrices. The result enhances our understanding of the behaviour of doubling algorithms for finding the…