相关论文: Global Uniqueness and Solvability for Tensor Compl…

We capture in the context of lex colimits, introduced by Garner and Lack, the universal property of the free regular and Barr-exact completions of a weakly lex category. This is done by introducing a notion of flatness for functors…

This paper extends the Lebesgue property and (weak) $G$-completeness to generalized quasi-uniform spaces. It investigates the connections between completeness, (weak) $G$-completeness, and the Lebesgue property of the product of generalized…

We construct universal geometric coefficients, over the integers, the rationals, and the reals, for cluster algebras arising from the once-punctured torus. We verify that the once-punctured torus has a property called the Null Tangle…

Kuznetsov and Polishchuk provided a general algorithm to construct exceptional collections of maximal length for homogeneous varieties of type A,B,C,D. We consider the case of the spinor tenfold and we prove that the corresponding…

This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…

In this work, we provide some novel results that establish both the existence of Henig global proper efficient points and their density in the efficient set for vector optimization problems in arbitrary normed spaces. Our results do not…

In this paper, we discuss some properties of of $G$-hull, $G$-kernel and $G$-connectedness, and extend some results of \cite{life34}. In particular, we prove that the $G$-connectedness are preserved by countable product. Moreover, we…

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, we study a class of toposes with enough points, the $\kappa$-separable toposes. These are equivalent to sheaf toposes over a site with $\kappa$-small limits that has at…

Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…

Topological Signal Processing (TSP) over simplicial complexes is a framework that has been recently proposed, as a generalization of graph signal processing (GSP), to extend GSP to analyzing signals defined over sets of any order (i.e., not…

Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved $\ell_0$ norm. In this paper, a special type of tensor complementarity problems with…

We denote by C_p(X,G) the group of all continuous functions from a space X to a topological group G endowed with the topology of pointwise convergence. We say that spaces X and Y are G-equivalent provided that the topological groups…

A perfect structure is a triple $(M,P,S)$ of matrices $M, P$ and $S$ of consistent sizes such that $MP = PS$. Perfect structures comprise similar matrices, eigenvectors, perfect colorings (equitable partitions) and graph coverings. In this…

Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable model for recursive programs with asynchronous atomic…

In this paper we discuss curvature tensors in the context of Absolute Parallelism geometry. Different curvature tensors are expressed in a compact form in terms of the torsion tensor of the canonical connection. Using the Bianchi identities…

We study tensor completion (TC) through the lens of low-rank tensor decomposition (TD). Many TD algorithms use fast alternating minimization methods to solve highly structured linear regression problems at each step (e.g., for CP, Tucker,…

We analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…

The tensor train (TT) format enjoys appealing advantages in handling structural high-order tensors. The recent decade has witnessed the wide applications of TT-format tensors from diverse disciplines, among which tensor completion has drawn…