Related papers: Sharpening a result by E.B. Davies and B. Simon

Let $A=\begin{bmatrix} A_{ij} \end{bmatrix}$ be an $n\times n$ operator matrix, where each $A_{ij}$ is a bounded linear operator on a complex Hilbert space. Among other numerical radius bounds, we show that $w(A)\leq w(\hat{A})$, where…

Inspired by the bad scientist who keeps repeating an experiment 20 times to get a single outcome with $p < 0.05$, we consider matrices $A \in \mathbb{R}^{n \times n}$ whose rows are normalized in $\ell^2$ and for which $2^{-n}\sum_{x \in…

We present two sharp, closed-form empirical Bernstein inequalities for symmetric random matrices with bounded eigenvalues. By sharp, we mean that both inequalities adapt to the unknown variance in a tight manner: the deviation captured by…

We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…

Given $d \ge 1$, let $(A_i)_{i\ge 1}$ be a sequence of random $d\times d$ real matrices and $Q$ be a random vector in $\mathbb{R}^d$. We consider fixed points of multivariate smoothing transforms, i.e. random variables $X\in \mathbb{R}^d$…

We give an approximation algorithm for non-uniform sparsest cut with the following guarantee: For any $\epsilon,\delta \in (0,1)$, given cost and demand graphs with edge weights $C, D$ respectively, we can find a set $T\subseteq V$ with…

W.E. Roth (1952) proved that the matrix equation $AX-XB=C$ has a solution if and only if the matrices $\left[\begin{matrix}A&C\\0&B\end{matrix}\right]$ and $\left[\begin{matrix}A&0\\0&B\end{matrix}\right]$ are similar. A. Dmytryshyn and B.…

The study of graph discrepancy problems, initiated by Erd\H{o}s in the 1960s, has received renewed attention in recent years. In general, given a $2$-edge-coloured graph $G$, one is interested in embedding a copy of a graph $H$ in $G$ with…

We show that every matrix $A \in \mathbb{R}^{n\times n}$ is at least $\delta$$\|A\|$-close to a real matrix $A+E \in \mathbb{R}^{n\times n}$ whose eigenvectors have condition number at most $\tilde{O}_{n}(\delta^{-1})$. In fact, we prove…

Let $D$ be a closed disk centered at the origin in the horizontal hyperplane $\{t=0\}$ of the sub-Riemannian Heisenberg group $\hh^n$, and $C$ the vertical cylinder over $D$. We prove that any finite perimeter set $E$ such that $D\subset…

Let A and C be self-adjoint operators such that the spectrum of A lies in a gap of the spectrum of C and let d>0 be the distance between the spectra of A and C. We prove that under these assumptions the sharp value of the constant c in the…

In what follows we improve an inequality related to matrix theory. T. Laffey proved (2013) a weaker form of this inequality [2].

Applying the solution to the Kadison-Singer problem, we show that every subset $\mathcal{S}$ of the torus of positive Lebesgue measure admits a Riesz sequence of exponentials $\left\{ e^{i\lambda x}\right\} _{\lambda \in \Lambda}$ such that…

We propose a definition of the Riemannian median $M(\mathbb{A})$ of a tuple of positive-definite matrices $\mathbb{A}:=(A_{1}, \cdots, A_{n})$. We will define it as a positive-definite matrix using Landers and Rogge's work \cite{Lan81}…

We will show in this paper that if $\lambda$ is very close to 1, then $$I(M,\lambda,m)= \sup_{u\in H^{1,n}_0(M) ,\int_M|\nabla u|^ndV=1}\int_\Omega (e^{\alpha_n |u|^\frac{n}{n-1}}-\lambda\sum\limits_{k=1}^m\frac{|\alpha_nu^\frac{n}{n-1}|^k}…

Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…

The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…

In this paper, we prove that the discrete Copson inequality (E.T. Copson, \emph{Notes on a series of positive terms}, J. London Math. Soc., 2 (1927), 49-51) of one-dimension in general cases admits an improvement. In fact we study the…

In this paper we obtain some slight correction and generalization of the results of Ryabtseva on the generalized resolvents for isometric operators with a gap in their spectrum. Also, analogs of some McKelvey's results and a short proof of…

We present a new improvement on the laser method for designing fast matrix multiplication algorithms. The new method further develops the recent advances by [Duan, Wu, Zhou FOCS 2023] and [Vassilevska Williams, Xu, Xu, Zhou SODA 2024].…