Related papers: On the sum of superoptimal singular values

We study infinite sums \[ {\mathcal P}_{\varkappa}=\sum_{n=-\infty}^\infty \varkappa_n \langle\cdot, \psi_n\rangle\psi_n \] of rank-one projections in a Hilbert space, where $\{\psi_n\}_{n\in\mathbb Z}$ are norm-one vectors, not necessarily…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

We study the problem of invariance of indices of thematic factorizations. Such factorizations were introduced in [PY1] for studying superoptimal approximation by bounded analytic matrix functions. As shown in [PY1], the indices may depend…

The Zarankiewicz function gives, for a chosen matrix and minor size, the maximum number of ones in a binary matrix not containing an all-one minor. Tables of this function for small arguments have been compiled, but errors are known in…

We study self-similar sets and measures on $\mathbb{R}^{d}$. Assuming that the defining iterated function system $\Phi$ does not preserve a proper affine subspace, we show that one of the following holds: (1) the dimension is equal to the…

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of $A(s)$ with $|\Im s| \leq T$ for some large constant $T$. What is the best way to use such finite spectral data…

We obtain a nontrivial bound on the number of solutions to the equation $A^{x_1} + A^{x_2} = A^{x_3} + A^{x_4}$, $1 \le x_1,x_2,x_3,x_4 \le \tau$, with a fixed $n\times n$ matrix $A$ over a finite field ${\mathbb F}_q$ of $q$ elements of…

Two square matrices of (arbitrary) order N are introduced. They are defined in terms of N arbitrary numbers z_{n}, and of an arbitrary additional parameter (a respectively q), and provide finite-dimensional representations of the two…

Let $\mathcal{M}$ be a von Neumann algebra, $\mathcal{I}$ a weak-operator dense ideal in $\mathcal{M}$, and $\Phi$ a unitarily invariant $\|\cdot\|$-dominating norm on $\mathcal{I}$. In this paper, we provide a necessary and sufficient…

In this work we start by determining all irreducible spherical functions $\Phi$ of any $K $-type associated to the pair $(G,K)=(\SO(4),\SO(3))$. The functions $P=P(u)$ corresponding to the irreducible spherical functions of a fixed $K$-type…

In 2006, Arveson resolved a long-standing problem by showing that for any element $x$ of a separable self-adjoint unital subspace $S\subseteq B(H)$, $\|x\|=\sup\|\pi(x)\|$, where $\pi$ runs over the boundary representations for $S$. Here we…

We study the general integer programming (IP) problem of optimizing a separable convex function over the integer points of a polytope: $\min \{f(\mathbf{x}) \mid A\mathbf{x} = \mathbf{b}, \, \mathbf{l} \leq \mathbf{x} \leq \mathbf{u}, \,…

Matrix completion is widely used in machine learning, engineering control, image processing, and recommendation systems. Currently, a popular algorithm for matrix completion is Singular Value Threshold (SVT). In this algorithm, the singular…

Let $E$ be a Jordan rectifiable curve in the complex plane and let $G$ be the bounded component of $\mathbb{C}\backslash E$. Now let $n\in \mathbb{N}$, and let $m_{n,E}$ denote the extremal constants defined by \begin{equation*}m_{n,E}=\inf…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Let $(M,g)$ be a closed Riemannian manifold of dimension $n\geq 3$. If $s$ is a positive integer satisfying $2s<n$, we let $P_g^s$ be the GJMS operator of order $2s$ in $M$. We investigate in this paper the extremal values taken by fixed…

Let $V = \{ v_1,\dots,v_N\}$ be a collection of $N$ vectors that live near a discrete sphere. We consider discrete directional maximal functions on $\mathbb{Z}^2$ where the set of directions lies in $V$, given by \[ \sup_{v \in V, k \geq C…

Let $D$ be a digraph of order $n$ with adjacency matrix $A(D)$. For $\alpha\in[0,1)$, the $A_{\alpha}$ matrix of $D$ is defined as $A_{\alpha}(D)=\alpha {\Delta}^{+}(D)+(1-\alpha)A(D)$, where…

Let ${\rm Mat}_n(\mathbb{F})$ denote the set of square $n\times n$ matrices over a field $\mathbb{F}$ of characteristic different from two. The permanental rank ${\rm prk}\,(A)$ of a matrix $A \in{\rm Mat}_{n}(\mathbb{F})$ is the size of…

We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…