On $Q$-Tensors
Zheng-Hai Huang, Yun-Yang Suo, Jie Wang

TL;DR
This paper extends key properties of $Q$-matrices to the tensor setting, establishing equivalences among classes of tensors and providing counterexamples to previous assumptions, advancing the theory of tensor complementarity problems.
Contribution
It generalizes fundamental results about $Q$-matrices to tensors, showing class equivalences within certain tensor categories and disproving some extensions.
Findings
Equivalence of $R_0$-, $R$-, $ER$-, and $Q$-tensors within strong $P_0$- and nonnegative tensors.
Counterexamples demonstrating certain $Q$-matrix properties do not extend to tensors.
Negative answer to a recent open question by Song and Qi.
Abstract
One of the central problems in the theory of linear complementarity problems (LCPs) is to study the class of -matrices since it characterizes the solvability of LCP. Recently, the concept of -matrix has been extended to the case of tensor, called -tensor, which characterizes the solvability of the corresponding tensor complementarity problem -- a generalization of LCP; and some basic results related to -tensors have been obtained in the literature. In this paper, we extend two famous results related to -matrices to the tensor space, i.e., we show that within the class of strong -tensors or nonnegative tensors, four classes of tensors, i.e., -tensors, -tensors, -tensors and -tensors, are all equivalent. We also construct several examples to show that three famous results related to -matrices cannot be extended to the tensor space; and one of which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Matrix Theory and Algorithms
