相关论文: On the Finiteness Property of the Polynomial Compl…

The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have polynomial-time computation but require…

Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…

In this work, we prove the existence of solutions for a tripled system of integral equations using some new results of fixed point theory associated with measure of noncompactness. These results extend some previous works in the literature,…

Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on…

We investigate purities determined by classes of finitely presented modules including the correspondence between purities for left and right modules. We show some cases where purities determined by matrices of given sizes are different.…

In this paper we apply a geometric covering method to study the number of ends on shrinkers. On one hand, we prove that the number of ends on any complete non-compact shrinker is at most polynomial growth with fixed degree. On the other…

This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many…

In recent years, low-rank based tensor completion, which is a higher-order extension of matrix completion, has received considerable attention. However, the low-rank assumption is not sufficient for the recovery of visual data, such as…

To efficiently express tensor data using the Tucker format, a critical task is to minimize the multilinear rank such that the model would not be over-flexible and lead to overfitting. Due to the lack of rank minimization tools in tensor,…

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We…

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

We prove some finiteness theorems for the Picard functor of an algebraic stack, in the spirit of SGA 6, exp. XII and XIII. In particular, we give a stacky version of Raynaud's relative representability theorem, we give sufficient conditions…

We study a nonlinear system made up of an elliptic equation of blended singular/degenerate type and Poisson's equation with a lowly integrable source. We prove the existence of a weak solution in any space dimension and, chiefly, derive an…

Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…

By using finiteness related result of non-abelian tensor product we prove finiteness conditions for the homotopy groups $\pi_n(X)$ in terms of the number of tensors. In particular, we establish a quantitative version of the classical…

The problem of incomplete data is common in signal processing and machine learning. Tensor completion algorithms aim to recover the incomplete data from its partially observed entries. In this paper, taking advantages of high…

A matrix always has a full rank submatrix such that the rank of this matrix is equal to the rank of that submatrix. This property is one of the corner stones of the matrix rank theory. We call this property the max-full-rank-submatrix…

We present solutions to the matrix completion problems proposed by the Alignment Research Center that have a polynomial dependence on the precision $\varepsilon$. The motivation for these problems is to enable efficient computation of…

The complexity class CLS was introduced by Daskalakis and Papadimitriou with the goal of capturing the complexity of some well-known problems in PPAD$~\cap~$PLS that have resisted, in some cases for decades, attempts to put them in…