Related papers: Preserving positivity for rank-constrained matrice…
Given a function $f$ on the positive half-line $\R_+$ and a sequence (finite or infinite) of points $X=\{x_k\}_{k=1}^\omega$ in $\R^n$, we define and study matrices $\kS_X(f)=\|f(|x_i-x_j|)\|_{i,j=1}^\omega$ called Schoenberg's matrices. We…
For a class of integral operators with kernels metric functions on manifold we find some necessary and sufficient conditions to have finite rank. The problem we pose has a stochastic nature and boils down to the following alternative…
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…
In this paper first we give a partial answer to a question of L. Moln\'ar and W. Timmermann. Namely, we will describe those linear (not necessarily bijective) transformations on the set of self-adjoint matrices which preserve a unitarily…
Functional depth is used for ranking functional observations from most outlying to most typical. The ranks produced by functional depth have been proposed as the basis for functional classifiers, rank tests, and data visualization…
Minimum phase functions are fundamental in a range of applications, including control theory, communication theory and signal processing. A basic mathematical challenge that arises in the context of geophysical imaging is to understand the…
Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…
The positive semidefinite rank of a nonnegative $(m\times n)$-matrix~$S$ is the minimum number~$q$ such that there exist positive semidefinite $(q\times q)$-matrices $A_1,\dots,A_m$, $B_1,\dots,B_n$ such that $S(k,\ell) = \mbox{tr}(A_k^*…
We investigate structural properties of the completely positive semidefinite cone $\mathcal{CS}_+^n$, consisting of all the $n \times n$ symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. This…
The matrix convexity and the matrix monotony of a real $C^1$ function $f$ on $(0,\infty)$ are characterized in terms of the conditional negative or positive definiteness of the Loewner matrices associated with $f$, $tf(t)$, and $t^2f(t)$.…
We first introduce the notion of meta-rank for a 2-parameter persistence module, an invariant that captures the information behind images of morphisms between 1D slices of the module. We then define the meta-diagram of a 2-parameter…
The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…
We discuss the problem of embedding univalent functions into Loewner chains in higher dimension. In particular, we prove that a normalized univalent map of the ball in $\C^n$ whose image is a smooth strongly pseudoconvex domain is…
Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…
The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…
We characterize when a size-2 positive semidefinite (psd) factorization of a positive matrix of rank 3 and psd rank 2 is unique. The characterization is obtained using tools from rigidity theory. In the first step, we define…
Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, for a broad class of rank functions called natural rank…
We define embedding of an $n$-dimensional normed space into $L_{-p},\ 0<p<n$ by extending analytically with respect to $p$ the corresponding property of the classical $L_p$-spaces. The well-known connection between embeddings into $L_p$ and…
An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…
This paper considers homogeneous order preserving continuous maps on the normal cone of an ordered normed vector space. It is shown that certain operators of that kind which are not necessarily compact themselves but have a compact power…