相关论文: Global Uniqueness and Solvability for Tensor Compl…
A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…
We study spherically-symmetric structures in Conformal Gravity and in a scalar-tensor extension and gain some more insight about these gravitational theories. In both cases we analyze solutions in two systems: perfect fluid solutions and…
In this paper, we consider the rank-one tensor completion problem. We address the question of existence and uniqueness of the rank-one solution. In particular we show that the global uniqueness over the field of real numbers can be verified…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…
The benefits of exploiting the presence of symmetries in tensor network algorithms have been extensively demonstrated in the context of matrix product states (MPSs). These include the ability to select a specific symmetry sector (e.g. with…
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. We discuss how to incorporate a global symmetry, given by a…
A novel tensor decomposition framework, termed Tensor Star (TS) decomposition, is proposed which represents a new type of tensor network decomposition based on tensor contractions. This is achieved by connecting the core tensors in a ring…
In this paper we introduce a new class of tuple-generating dependencies (TGDs) called triangularly-guarded (TG) TGDs. We show that conjunctive query answering under this new class of TGDs is decidable since this new class of TGDs also…
In this paper we provide a \emph{global} investigation of the geometry of parallelizable manifolds (or absolute parallelism geometry) frequently used for application. We discuss the different linear connections and curvature tensors from a…
We study rigidity/flexibility properties of global solutions to the thin obstacle problem. For solutions with bounded positive sets, we give a classification in terms of their expansions at infinity. For solutions with bounded contact sets,…
We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$.…
New families of algebras and DG algebras with two simple modules are introduced and described. Using the twisted tensor product operation, we prove that such algebras have finite global dimension, and the resulting DG algebras are smooth.…
The concept of double nonnegativity of matrices is generalized to doubly nonnegative tensors by means of the nonnegativity of all entries and $H$-eigenvalues. This generalization is defined for tensors of any order (even or odd), while it…
Tree tensor networks such as the tensor train format are a common tool for high dimensional problems. The associated multivariate rank and accordant tuples of singular values are based on different matricizations of the same tensor. While…
We study the tensor robust principal component analysis (TRPCA) problem, a tensorial extension of matrix robust principal component analysis (RPCA), that aims to split the given tensor into an underlying low-rank component and a sparse…
In this paper, we introduce semi-infinite tensor complementarity problem to provide an approach for considering a more realistic situation of the problem. We prove the necessary and sufficient conditions for the existence of the solution…
The aim of this elaborate is presenting the classical symmetric tensors completion problem to an audience of graduate students. As main studying tool, we will introduce the theory of hypergraph rigidity which naturally mirrors the problem…
Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…
In this research article, we discuss two topics. Firstly, we introduce SCC-Map and $\phi$-contraction type $T$-coupling. By using these two definitions, we generalize $\phi$-contraction type coupling given by H. Aydi et al. [3] to…