Related papers: On the Symmetric Tensors Completion Problem
Completely positive graphs have been employed to associate with completely positive matrices for characterizing the intrinsic zero patterns. As tensors have been widely recognized as a higher-order extension of matrices, the…
Tensor train (TT) representation has achieved tremendous success in visual data completion tasks, especially when it is combined with tensor folding. However, folding an image or video tensor breaks the original data structure, leading to…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a third-order…
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. Irreflexive signed graphs are in a…
This paper discusses the problem of symmetric tensor decomposition on a given variety $X$: decomposing a symmetric tensor into the sum of tensor powers of vectors contained in $X$. In this paper, we first study geometric and algebraic…
The problems of continuation of a partially defined metric and a partially defined ultrametric were considered in (O. Dovgoshey, O. Martio and M. Vuorinen, Metrization of weighted graphs, Ann. Comb., 17:455--476, 2013) and (A. A. Dovgoshey…
Rigidity theory studies the properties of graphs that can have rigid embeddings in a euclidean space $\mathbb{R}^d$ or on a sphere and which in addition satisfy certain edge length constraints. One of the major open problems in this field…
In this thesis, two aspects of string theory are discussed, tensionless strings and supersymmetric sigma models. The equivalent to a massless particle in string theory is a tensionless string. Even almost 30 years after it was first…
We present a uniform treatment of rigid supersymmetric field theories in a curved spacetime $\mathcal{M}$, focusing on four-dimensional theories with four supercharges. Our discussion is significantly simpler than earlier treatments,…
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…
Adjacency between two vertices in graphs or hypergraphs is a pairwise relationship. It is redefined in this article as 2-adjacency. In general hypergraphs, hyperedges hold for $n$-adic relationship. To keep the $n$-adic relationship the…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
A hypergraph is called uniform when every hyperedge contains the same number of vertices, otherwise, it is called non-uniform. In the real world, many systems give rise to non-uniform hypergraphs, such as email networks and co-authorship…
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued, pairwise orthogonal vectors. Such decompositions do not generally exist, but we show that some symmetric tensor decomposition…
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…
Hypergraphs and tensors extend classic graph and matrix theory to account for multiway relationships, which are ubiquitous in engineering, biological, and social systems. While the Kronecker product is a potent tool for analyzing the…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
The estimation of correspondences between two images resp. point sets is a core problem in computer vision. One way to formulate the problem is graph matching leading to the quadratic assignment problem which is NP-hard. Several so called…
Supersymmetric gauge theories have played a central role in applications of quantum field theory to mathematics. Topologically twisted supersymmetric gauge theories often admit a rigorous mathematical description: for example, the Donaldson…