Related papers: Global Uniqueness and Solvability for Tensor Compl…
This paper is concerned with the open problem proposed in Ammari et. al. Commun. Math.Phys, 2013. We first investigate the existence and uniqueness of Generalized Polarization Tensors (GPTs) vanishing structures locally in both two and…
In multilinear algebra, some special classes of matrices are extended to higher order structured tensors. The local $w$-uniqueness solution to the linear complementarity problem can be identified by the column competent matrix. Motivated by…
How can we accurately complete tensors by learning relationships of dimensions along each mode? Tensor completion, a widely studied problem, is to predict missing entries in incomplete tensors. Tensor decomposition methods, fundamental…
Our purpose is to investigate the local boundedness, the upper semicontinuity, and the stability of the solution map of tensor complementarity problems. To do this, we focus on the set of R$_0$--tensors and show that this set plays an…
In recent years several classes of structured matrices are extended to classes of tensors in the context of tensor complementarity problem. The tensor complementarity problem is a class of nonlinear complementarity problem where the…
While Bernoulli sampling is extensively studied in tensor completion, t-CUR sampling approximates low-tubal-rank tensors via lateral and horizontal subtensors. However, both methods lack sufficient flexibility for diverse practical…
In this paper, we introduce set-valued tensor complementarity problem where the elements of the involved tensors are defined based on a set-valued mapping. We study several properties of the solution set under the framework of set-valued…
In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is an interesting generalization of matrix eigenvalue complementarity problem (EiCP). First, we given an affirmative result showing that…
The system of tensor equations (TEs) has received much considerable attention in the recent literature. In this paper, we consider a class of generalized tensor equations (GTEs). An important difference between GTEs and TEs is that GTEs can…
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed…
The tensor complementarity problem $(\q, \mathcal{A})$ is to $$\mbox{ find } \x \in \mathbb{R}^n\mbox{ such that }\x \geq \0, \q + \mathcal{A}\x^{m-1} \geq \0, \mbox{ and }\x^\top (\q + \mathcal{A}\x^{m-1}) = 0.$$ We prove that a real…
We prove that many completeness properties coincide in metric spaces, precompact groups and dense subgroups of products of separable metric groups. We apply these results to function spaces C_p(X,G) of G-valued continuous functions on a…
The spectrum of a tensor-triangulated category carries a compact Hausdorff topology, called the constructible topology, also known as the patch topology. We prove that patch-dense subsets detect tt-ideals and we prove that any infinite…
We consider the problem of low canonical polyadic (CP) rank tensor completion. A completion is a tensor whose entries agree with the observed entries and its rank matches the given CP rank. We analyze the manifold structure corresponding to…
We investigate the uniqueness of decomposition of general tensors $T\in {\mathbb C}^{n_1+1}\otimes\cdots\otimes{\mathbb C}^{n_r+1}$ as a sum of tensors of rank $1$. This is done extending the theory developed in a previous paper by the…
We study the design of stochastic local search methods to prove unsatisfiability of a constraint satisfaction problem (CSP). For a binary CSP, such methods have been designed using the microstructure of the CSP. Here, we develop a method to…
In this paper we study the locus of singular tuples of a complex valued multisymmetric tensor. The main problem that we focus on is: given the set of singular tuples of some general tensor, which are all the tensors that admit those same…
Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability. Current tools for constraint solving typically…
Two non-discrete Hausdorff group topologies $\tau, \delta$ on a group $G$ are called {\it transversal} if the least upper bound $\tau\vee \delta$ of $\tau$ and $\delta$ is the discrete topology. In this paper, we discuss the existence of…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…