Related papers: Equations of tensor eigenschemes
In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for…
In this series of papers I examine a special kind of geometric objects that can be defined in space-time --- five-dimensional tangent vectors. Similar objects exist in any other differentiable manifold, and their dimension is one unit…
By excluding some sets, which don't include any eigenvalue of a tensor, from some existing eigenvalue inclusion sets, two new sets are given to locate all eigenvalues of a tensor. And it is shown that these two sets are contained in the…
We introduce the notion of angular values for deterministic linear difference equations and random linear cocycles. We measure the principal angles between subspaces of fixed dimension as they evolve under nonautonomous or random linear…
Random tensor models have applications in a variety of fields, such as quantum gravity, quantum information theory, mathematics of modern technologies, etc., and studying their statistical properties, e.g., tensor eigenvalue/vector…
The largest eigenvalue of random tensors is an important feature of systems involving disorder, equivalent to the ground state energy of glassy systems or to the injective norm of quantum states. For symmetric Gaussian random tensors of…
Spatial symmetries and invariances play an important role in the behaviour of materials and should be respected in the description and modelling of material properties. The focus here is the class of physically symmetric and positive…
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…
The eigenvector-eigenvalue identities are expanded to include general mixing parameters. Some simple relations are obtained and they reveal an intricate texture of connections between the eigenvalues and the mixing parameters. Permutation…
We present a method to linearize, without approximation, a specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the nonlinearities are expressed by scalar functions that are defined by a quotient of linear…
The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…
Here we present some eigenstates for a 2+1-dimensional model associated with a solution of the tetrahedron equation. The eigenstates include those "particle-like" (namely one-particle and two-particle ones), constructed in analogy with the…
The map which takes a square matrix to its tropical eigenvalue-eigenvector pair is piecewise linear. We determine the cones of linearity of this map. They are simplicial but they do not form a fan. Motivated by statistical ranking, we also…
We algebraically compute all possible sectional curvature values for canonical algebraic curvature tensors, and use this result to give a method for constructing general sectional curvature bounds. We use a well-known method to…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
The second order Killing and conformal tensors are analyzed in terms of their spectral decomposition, and some properties of the eigenvalues and the eigenspaces are shown. When the tensor is of type I with only two different eigenvalues,…
Identifying locally optimal solutions is an important issue given an optimization model. In this paper, we focus on a special class of symmetric tensors termed regular simplex tensors, which is a newly-emerging concept, and investigate its…
A generalized eigenvector of a hypermatrix, called the universal (U-) eigenvector, is proposed, which extended the notion of diagonal (D-) eigenvectors in the literature. Using the semi-tensor product, the homogeneous U-eigenequation can be…
We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's…
The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…