Related papers: Global Uniqueness and Solvability for Tensor Compl…

In this article, we investigate the existence and uniqueness of weak solutions to the continuous coagulation equation with collisional breakage for a class of unbounded collision kernels and distribution function. The collision kernels and…

Heterogeneous k-core percolation is an extension of a percolation model which has interesting applications to the resilience of networks under random damage. In this model, the notion of node robustness is local, instead of global as in…

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…

In this note we study the uniqueness problem for collections of pennies and marbles. More generally, consider a collection of unit $d$-spheres that may touch but not overlap. Given the existence of such a collection, one may analyse the…

In this paper, we present an equitable partition theorem of tensors, which gives the relations between $H$-eigenvalues of a tensor and its quotient equitable tensor and extends the equitable partitions of graphs to hypergraphs. Furthermore,…

We present several conditions for generic uniqueness of tensor decompositions of multilinear rank (1,L_{1}, L_{1}),..., (1, L_{R}, L_{R}) terms. In geometric language, we prove that the joins of relevant subspace varieties are not…

We prove that the class of topological knot types that are both Legendrian simple and satisfy the uniform thickness property (UTP) is closed under cabling. An immediate application is that all iterated cabling knot types that begin with…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitian matrices. For the CPS tensor decomposition some properties are presented. For real CPS tensors in particular, we note the subtle difference from the complex case of…

Many natural computational problems in computer science, mathematics, physics, and other sciences amount to deciding if two objects are equivalent. Often this equivalence is defined in terms of group actions. A natural question is to ask…

Tensor completion estimates missing components by exploiting the low-rank structure of multi-way data. The recently proposed methods based on tensor train (TT) and tensor ring (TR) show better performance in image recovery than classical…

We construct a tensor network that delivers an unnormalized quantum state whose coefficients are the solutions to a given instance of 3SAT, an NP-complete problem. The tensor network contraction that corresponds to the norm of the state…

The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have demonstrated to play a…

We study compactness properties of the set of conformally flat singular metrics with constant, positive sixth order Q-curvature on a finitely punctured sphere. Based on a recent classification of the local asymptotic behavior near isolated…

We study open zooming systems and potentials with uniqueness of equilibrium states. The uniqueness is established for a certain class of zooming potentials when the map is topologically exact, including the null one. Also, with equilibrium…

We prove the existence of positive solutions for a class of semipositone problem with singular Trudinger-Moser nonlinearities. The proof is based on compactness and regularity arguments.

By using the representational power of Chu spaces we define the notion of a generalized topological space (or GTS, for short), i.e., a mathematical structure that generalizes the notion of a topological space. We demonstrate that these…

Tensor networks (TNs) have been gaining interest as multiway data analysis tools owing to their ability to tackle the curse of dimensionality and to represent tensors as smaller-scale interconnections of their intrinsic features. However,…

Tensor completion refers to the problem of recovering the missing, corrupted or unobserved entries in data represented by tensors. In this paper, we tackle the tensor completion problem in the scenario in which multiple tensor acquisitions…

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. In a recent paper [arXiv:0907.2994v1] we discussed how to…