Related papers: Sharp nonzero lower bounds for the Schur product t…

Let $ m, n $ be integers such that $ \frac{n}{2} > m \geq 1 $ and let $ (M, g) $ be a closed $ n-$dimensional Riemannian manifold. We prove there exists some $ B \in \mathbb{R} $ depending only on $ (M, g) $, $ m $, and $ n $ such that for…

We say that an $R$-module $M$ is {\it virtually simple} if $M\neq (0)$ and $N\cong M$ for every non-zero submodule $N$ of $M$, and {\it virtually semisimple} if each submodule of $M$ is isomorphic to a direct summand of $M$. We carry out a…

Let $A \in \Omega_n$ be doubly-stochastic $n \times n$ matrix. Alexander Schrijver proved in 1998 the following remarkable inequality per(\widetilde{A}) \geq \prod_{1 \leq i,j \leq n} (1- A(i,j)); \widetilde{A}(i,j) =: A(i,j)(1-A(i,j)), 1…

It is shown that a $N\times N$ real symmetric [complex hermitian] positive definite matrix $V$ is congruent to a diagonal matrix modulo a pseudo-orthogonal [pseudo-unitary] matrix in $SO(m,n)$ [ $SU(m,n)$], for any choice of partition…

For a positive linear map F and a normal matrix N, we show that |F(N)| is bounded by some simple linear combinations in the unitary orbit of F(|N|). Several elegant sharp inequalities are derived, especially for the Schur product.

For a {bounded} non-negative self-adjoint operator acting in a complex, infinite-dimensional, separable Hilbert space H and possessing a dense range R we propose a new approach to characterisation of phenomenon concerning the existence of…

Weingarten functions provide a tool for computing Haar measure matrix integrals of polynomials in the matrix entries. An important property of Weingarten functions, is their particularly simple large $N$ limits. In 2017 Benoit Collins and…

The EPR correlation matrix admit a Hilbert model if it can be extended to a positive full correlation matrix. A simple proof of the corresponding Tsirelson bound is given and the relations to PR boxes and indefinite inner product spaces are…

Let $\{x_{\alpha}\}_{\alpha \in \mathbb{Z}}$ and $\{y_{\alpha}\}_{\alpha \in \mathbb{Z}}$ be two independent collections of zero mean, unit variance random variables with uniformly bounded moments of all orders. Consider a nonsymmetric…

Developed in a series of seminal papers in the early 2010s, the tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features such as a tensor Singular Value…

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…

In this paper, we give strong lower bounds on the size of the sets of products of matrices in some certain groups. More precisely, we prove an analogue of a result due to Chapman and Iosevich for matrices in $SL_2(\mathbb{F}_p)$ with…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

We establish a positivity property for a class of semilinear elliptic problems involving indefinite sublinear nonlinearities. Namely, we show that any nontrivial nonnegative solution is positive for a class of problems the strong maximum…

The notions of infimum and maximal lower bounds of a set $\mathfrak M$ of bounded self-adjoint operators were mainly studied for a set $\mathfrak M$ of two elements. The present paper deals with more general sets $\mathfrak M$, where it is…

Let $N_n$ be an $n\times n$ complex random matrix, each of whose entries is an independent copy of a centered complex random variable $z$ with finite non-zero variance $\sigma^{2}$. The strong circular law, proved by Tao and Vu, states that…

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…

We study two fundamental optimization problems: (1) scaling a symmetric positive definite matrix by a positive diagonal matrix so that the resulting matrix has row and column sums equal to 1; and (2) minimizing a quadratic function subject…

We show how the numerical range of a matrix can be used to bound the optimal value of certain optimization problems over real tensor product vectors. Our bound is stronger than the trivial bounds based on eigenvalues, and can be computed…

Let $\mathfrak{M}(\mathbb{D}, m, n, P)$ be the ring of all $m \times n$ matrices over a division ring $\mathbb{D}$, with the product given by $A \bullet B=A P B$, where $P$ is a fixed $n \times m$ matrix over $\mathbb{D}$. When $2\leq m, n…