Related papers: On the sum of superoptimal singular values

The main purpose of this paper is to compute all irreducible spherical functions on $G=\SU(3)$ of arbitrary type $\delta\in \hat K$, where $K={\mathrm{S}}(\mathrm{U}(2)\times\mathrm{U}(1))\simeq\mathrm{U}(2)$. This is accomplished by…

We develop a pseudo-likelihood theory for rank one matrix estimation problems in the high dimensional limit. We prove a variational principle for the limiting pseudo-maximum likelihood which also characterizes the performance of the…

We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…

We prove existence and uniqueness of a solution of the Dirichlet problem for separately $(\alpha, \beta)$ - harmonic functions on the unit polydisc $\mathbb D^n$ with boundary data in $C(\mathbb T^n)$ using $(\alpha, \beta)$ - Poisson…

We consider the minimization problem of a sum of a number of functions having Lipshitz $p$-th order derivatives with different Lipschitz constants. In this case, to accelerate optimization, we propose a general framework allowing to obtain…

The symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. The optimal…

In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The…

We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

We study some sum-product problems over matrix rings. Firstly, for $A, B, C\subseteq M_n(\mathbb{F}_q)$, we have $$ |A+BC|\gtrsim q^{n^2}, $$ whenever $|A||B||C|\gtrsim q^{3n^2-\frac{n+1}{2}}$. Secondly, if a set $A$ in $M_n(\mathbb{F}_q)$…

Let $spex(n,H_{minor})$ denote the maximum spectral radius of $n$-vertex $H$-minor free graphs. The problem on determining this extremal value can be dated back to the early 1990s. Up to now, it has been solved for $n$ sufficiently large…

Complex-valued functions defined on a finite interval $[a,b]$ generalizing power functions of the type $(x-x_0)^n$ for $n\geq 0$ are studied. These functions called $\Phi$-generalized powers, $\Phi$ being a given nonzero complex-valued…

The supporting vectors of a matrix A are the solutions of max || x ||_2 =1 {||Ax||_2^2}. The generalized supporting vectors of matrices A_1 , . . . , A_k are the solutions of max || x ||_2 =1 {||A_1x||_2^2 + ||A_2x||_2^2 + ... +…

A property $\Pi$ on a finite set $U$ is \emph{monotone} if for every $X \subseteq U$ satisfying $\Pi$, every superset $Y \subseteq U$ of $X$ also satisfies $\Pi$. Many combinatorial properties can be seen as monotone properties. The problem…

We characterize the action of isotropic pseudodifferential operators on functions in terms of their action on Hermite functions. We show that an operator $A : S(\mathbb{R}) \to S(\mathbb{R})$ is an isotropic pseudodifferential operator of…

We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices…

Our main purpose in this paper is to investigate a supercritical Sobolev-type inequality for the $k$-Hessian operator acting on $\Phi^{k}_{0,\mathrm{rad}}(B)$, the space of radially symmetric $k$-admissible functions on the unit ball…

We say a zero-one matrix $A$ avoids another zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. A fundamental problem is to study the extremal function $ex(n,P)$, the maximum number of…

Across many disciplines from neuroscience and genomics to machine learning, atmospheric science and finance, the problems of denoising large data matrices to recover signals obscured by noise, and of estimating the structure of these…

In this paper, we study tail inequalities of the largest eigenvalue of a matrix infinitely divisible (i.d.) series, which is a finite sum of fixed matrices weighted by i.d. random variables. We obtain several types of tail inequalities,…