Related papers: Extended Horizontal Tensor Complementarity Problem…
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…
We study the uniqueness of enhancements of tensor-triangulated categories. To do so, we provide conditions under which these enhancements interact well with categorical decompositions. As an application we obtain new results about the…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
The concepts of P- and P$_0$-matrices are generalized to P- and P$_0$-tensors of even and odd orders via homogeneous formulae. Analog to the matrix case, our P-tensor definition encompasses many important classes of tensors such as the…
In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We…
In this paper, we study the linear complementarity problems on the monotone extended second order cones. We demonstrate that the linear complementarity problem on the monotone extended second order cone can be converted into a mixed…
Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved $\ell_0$ norm. In this paper, a special type of tensor complementarity problems with…
A weighted complementarity problem (wCP) is to find a pair of vectors belonging to the intersection of a manifold and a cone such that the product of the vectors in a certain algebra equals a given weight vector. If the weight vector is…
We investigate the structure of join tensors, which may be regarded as the multivariable extension of lattice-theoretic join matrices. Explicit formulae for a polyadic decomposition (i.e., a linear combination of rank-1 tensors) and a…
In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…
In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker (HT) tensors, an efficient structured tensor format based on recursive subspace factorizations. By exploiting the…
Bit threads, a dual description of the Ryu-Takyanagi formula for holographic entanglement entropy (EE), can be interpreted as a distillation of the quantum information to a collection of Bell pairs between different boundary regions. In…
We study the complexity of horizontality in the twistor space $\hat{E}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over a torus. If the horizontality has finite complexity of degree $d>2$ for…
Tensor completion can estimate missing values of a high-order data from its partially observed entries. Recent works show that low rank tensor ring approximation is one of the most powerful tools to solve tensor completion problem. However,…
We analyze the problem of high-order polynomial approximation from a many-body physics perspective, and demonstrate the descriptive power of entanglement entropy in capturing model capacity and task complexity. Instantiated with a…
We introduce a Kojima-Megiddo-Mizuno type continuation method for solving tensor complementarity problems. We show that there exists a bounded continuation trajectory when the tensor is strictly semi-positive and any limit point tracing the…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…