Related papers: A lower bound for the Balan--Jiang matrix problem

In this paper, we investigate the generalized low rank approximation to the symmetric positive semidefinite matrix in the Frobenius norm: $$\underset{ rank(X)\leq k}{\min} \sum^m_{i=1}\left \Vert A_i - B_i XB_i^T \right \Vert^2_F,$$ where…

This paper considers the problem of matrix-variate logistic regression. It derives the fundamental error threshold on estimating low-rank coefficient matrices in the logistic regression problem by obtaining a lower bound on the minimax…

We establish the existence of solutions to the following semilinear Neumann problem for fractional Laplacian and critical exponent: \begin{align*}\left\{\begin{array}{l l} { (-\Delta)^{s}u+ \lambda u= \abs{u}^{p-1}u } & \text{in $ \Omega,$…

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

The paper concerns with positive solutions of problems of the type $-\Delta u+a(x)\, u=u^{p-1}+\varepsilon u^{2^*-1}$ in $\Omega\subseteq\mathbb{R}^N$, $N\ge 3$, $2^*={2N\over N-2}$, $2<p<2^*$. Here $\Omega$ can be an exterior domain, i.e.…

The boundary value problem is examined for the system of elliptic equations of from $-\Delta u + A(x)u = 0 \quad\text{in} \Omega,$ where $A(x)$ is positive semidefinite matrix on $\mathbb{R}^{{k}\times{k}},$ and $\frac{\partial u}{\partial…

We establish necessary and sufficient conditions for the existence of an LU factorization $A=LU$ for an arbitrary square matrix $A$, including singular and rank-deficient cases, without the use of row or column permutations. We prove that…

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…

We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…

Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and…

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…

A result of Nayak asserts that $\underset{m\to \infty}\lim |A^m|^{1/m}$ exists for each $n\times n$ complex matrix $A$, where $|A| = (A^*A)^{1/2}$, and the limit is given in terms of the spectral decomposition. We extend the result of…

We consider $\ell_1$-Rank-$r$ Approximation over GF(2), where for a binary $m\times n$ matrix ${\bf A}$ and a positive integer $r$, one seeks a binary matrix ${\bf B}$ of rank at most $r$, minimizing the column-sum norm $||{\bf A} -{\bf…

A sign pattern matrix is a matrix whose entries are from the set $\{+,-,0\}$. If $A$ is an $m\times n$ sign pattern matrix, the qualitative class of $A$, denoted $Q(A)$, is the set of all real $m\times n$ matrices $B=[b_{i,j}]$ with…

Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of…

Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…

If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

The Deligne-Simpson problem is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset SL(n,{\bf C})$ or $c_j\subset sl(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples of…