相关论文: Eigenvalues and equivalence classes of third-order…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
In finitely cocomplete homological categories, co-smash products give rise to (possibly higher-order) commutators of subobjects. We use binary and ternary co-smash products and the associated commutators to give characterisations of…
Consider the spaces of pseudodifferential operators between tensor density modules over the line as modules of the Lie algebra of vector fields on the line. We compute the equivalence classes of various subquotients of these modules. There…
Given a $n$-dimensional Riemannian manifold of arbitrary signature, we illustrate an algebraic method for constructing the coordinate webs separating the geodesic Hamilton-Jacobi equation by means of the eigenvalues of $m \leq n$ Killing…
We prove that the general symmetric tensor in $S^d {\mathbb C}^{n+1}$ of rank r is identifiable, provided that r is smaller than the generic rank. That is, its Waring decomposition as a sum of r powers of linear forms is unique. Only three…
We consider the 4-dimensional $\mathcal{N}=1$ Lie superconformal algebra and search for completely "symmetric" (in the graded sense) 3-index invariant tensors. The solution we find is unique and we show that the corresponding invariant…
We consider eigenvalue condition numbers and backward errors for a class of symmetric nonlinear eigenvalue problems with eigenvector nonlinearities. For both of these quantities, we derive explicit and computable expressions that can be…
A third order real tensor is mapped to a special f-diagonal tensor by going through Discrete Fourier Transform (DFT), standard matrix SVD and inverse DFT. We call such an f-diagonal tensor an s-diagonal tensor. An f-diagonal tensor is an…
In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new…
Well known connections exist between the singular value decomposition of a matrix A and the Schur decomposition of its symmetric embedding sym(A) = [ 0 A; A' 0]. In particular, if s is a singular value of A then +s and -s are eigenvalues of…
We consider a class of linear eigenvalue problems depending on a small parameter epsilon in which the series expansion for the eigenvalue in powers of epsilon is divergent. We develop a new technique to determine the precise nature of this…
Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…
The $\mathit{SU}(3)$ tensor multiplicities are piecewise polynomial of degree $1$ in their labels. The pieces are the chambers of a complex of cones. We describe in detail this chamber complex and determine the group of all linear…
Starting from a mistake done by a student, we discover an unexpected method of finding both eigenvectors for a $2\times2$ matrix with distinct eigenvalues in a single computation. We discuss a connection with the Cayley-Hamilton theorem,…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
A correspondence between the sextic anharmonic oscillator and a pair of third-order ordinary differential equations is used to investigate the phenomenon of quasi-exact solvability for eigenvalue problems involving differential operators…
4x4x3 absolutely nonsingular tensors are characterized by their determinant polynomial. Non-quivalence among absolutely nonsingular tensors with respect to a class of linear transformations, which do not chage the tensor rank,is studied. It…
The concept of tensor rank, introduced in the twenties, has been popularized at the beginning of the seventies. This has allowed to carry out Factor Analysis on arrays with more than two indices. The generic rank may be seen as an upper…
We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…
We study symmetric tensor decompositions, i.e. decompositions of the input symmetric tensor T of order 3 as sum of r 3rd-order tensor powers of u_i where u_i are vectors in \C^n. In order to obtain efficient decomposition algorithms, it is…