Related papers: Note on the Construction of Structure Tensor
The purpose of this paper is to initiate a phase theory for tensors under the Einstein product, and explore its applications in multilinear control systems. Firstly, the sectorial tensor decomposition for sectorial tensors is derived, which…
For a positive definite fundamental tensor all known examples of Osserman algebraic curvature tensors have a typical structure. They can be produced from a metric tensor and a finite set of skew-symmetric matrices which fulfil Clifford…
We study the problem of variable selection in convex nonparametric least squares (CNLS). Whereas the least absolute shrinkage and selection operator (Lasso) is a popular technique for least squares, its variable selection performance is…
Some years ago Koutras presented a method of constructing a conformal Killing tensor from a pair of orthogonal conformal Killing vectors. When the vector associated with the conformal Killing tensor is a gradient, a Killing tensor (in…
Particle systems admit a variety of tensor product structures (TPSs) depending on the complete system of commuting observables chosen for the analysis. Different notions of entanglement are associated with these different TPSs. Global…
We relate canonical algebraic curvature tensors that are built from a self-adjoint ($R^S_A$) or skew adjoint ($R^{\Lambda}_A$) linear operator A. Several authors have proven that any algebraic curvature tensor $R$ may be expressed as a sum…
We study tensor products of two structures situated, in a sense, between normed spaces and (abstract) operator spaces. We call them Lambert and proto-Lambert spaces and pay more attention to the latter ones. The considered two tensor…
Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent them from handling real-world problems. Recently, a…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
The deuteron is the lightest spin-1 nucleus, consisting of a weakly bound system of two spin-1/2 nucleons. One intriguing characteristic of the deuteron is the tensor polarized structure, which cannot be naively constructed combining the…
We propose the entanglement bipartitioning approach to design an optimal network structure of the tree-tensor-network (TTN) for quantum many-body systems. Given an exact ground-state wavefunction, we perform sequential bipartitioning of…
The tensor complementarity problem is a specially structured nonlinear complementarity problem, then it has its particular and nice properties other than ones of the classical nonlinear complementarity problem. In this paper, it is proved…
Most regularized tensor regression research focuses on tensors predictors with scalars responses or vectors predictors to tensors responses. We consider the sparse low rank tensor on tensor regression where predictors $\mathcal{X}$ and…
Tensor networks have in recent years emerged as the powerful tools for solving the large-scale optimization problems. One of the most popular tensor network is tensor train (TT) decomposition that acts as the building blocks for the…
Given a vector-space $~V~$ which is the tensor product of vector-spaces $A$ and $B$, we reconstruct $A$ and $B$ from the family of simple tensors $a{\otimes}b$ within $V$. In an application to quantum mechanics, one would be reconstructing…
In this paper we propose a general spectral theory for tensors. Our proposed factorization decomposes a tensor into a product of orthogonal and scaling tensors. At the same time, our factorization yields an expansion of a tensor as a…
The representation theory of tensor functions is a powerful mathematical tool for constitutive modeling of anisotropic materials. A major limitation of the traditional theory is that many point groups require fourth- or sixth-order…
We prove a conjecture of W. Hackbusch about tensor network states related to a perfect binary tree and train track tree. Tensor network states are used to present seemingly complicated tensors in a relatively simple and efficient manner.…
We construct the geometric Langlands functor in one direction (from the automorphic to the spectral side) in characteristic zero settings (i.e., de Rham and Betti). We prove that various forms of the conjecture (de Rham vs Betti, restricted…
Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…