Related papers: $k$-Positive Maps: New Characterizations and a Gen…

We study methods of inducing metrics on unital completely positive maps by employing seminorms arising in noncommutative geometry. Our main approach relies on the development of an infinite-dimensional $C^*$-algebraic analogue of the…

The concept of a k-translatable groupoid is explored in depth. Some properties of idempotent k-translatable groupoids, left cancellative k-translatable groupoids and left unitary k-translatable groupoids are proved. Necessary and sufficient…

In this paper we compute Lawson homology groups and semi-topological K-theory for some threefolds and fourfolds. We consider smooth complex projective varieties whose zero cycles are supported on a proper subvariety. Rationally connected…

Let M be a p-by-q matrix with nonnegative entries. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices $A_i, B_j$ of size $k \times k$ such that $M_{ij} =…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

Polyhedra and spectrahedra over the real numbers, or more generally their images under linear maps, are respectively the feasible sets of linear and semidefinite programming, and form the family of semidefinite-representable sets. This…

We present certain techniques to find completely positive maps between matrix algebras that take prescribed values on given data. To this aim we describe a semidefinite programming approach and another convex minimization method supported…

We propose a family of four-parameter distributions that contain the K-distribution as special case. The family is derived as a mixture distribution that uses the three-parameter reflected Gamma distribution as parental and the…

Let $k$ be an algebraically closed field of positive characteristic $p$ and let $\mathbb{G}_a$ denote the additive group of $k$. Let $n \geq 1$ and let ${\rm Mat}(n, k[T])^E$ denote the set of all exponential matrices of ${\rm Mat}(n,…

We explore distribution questions for rational maps on the projective line $\mathbb{P}^1$ over $\mathbb{Q}$ within the framework of arithmetic dynamics, drawing analogies to elliptic curves. Specifically, we investigate counting problems…

We present a rigorous and fully consistent $K$-theoretic framework for studying gapped topological phases of free fermions such as topological insulators. It utilises and profits from powerful techniques in operator $K$-theory. From the…

By the Choi matrix criteria it is easy to determine if a specific linear matrix map is completely positive, but to establish whether a linear matrix map is positive is much less straightforward. In this paper we consider classes of linear…

A sign pattern is a matrix whose entries are from the set $\{+,-, 0\}$. A square sign pattern $A$ is called sign $k$-potent if $k$ is the smallest positive integer for which $A^{k+1}=A$, and for $k=1$, $A$ is called sign idempotent. In…

We study three fundamental problems of Linear Algebra, lying in the heart of various Machine Learning applications, namely: 1)"Low-rank Column-based Matrix Approximation". We are given a matrix A and a target rank k. The goal is to select a…

We address the problems of minimizing and of maximizing the spectral radius overa compact family of non-negative matrices. Those problems being hard in generalcan be efficiently solved for some special families. We consider the so-called…

A linear map $\Phi :\mathbb{M}_n \to \mathbb{M}_k$ is called completely copositive if the resulting matrix $[\Phi (A_{j,i})]_{i,j=1}^m$ is positive semidefinite for any integer $m$ and positive semidefinite matrix $[A_{i,j}]_{i,j=1}^m$. In…

Finding a list of k teams of experts, referred to as top-k team formation, with the required skills and high collaboration compatibility has been extensively studied. However, existing methods have not considered the specific collaboration…

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…