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

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n$. Rivlin \cite{Rivlin} proved that if $p(z)\neq 0$ in the unit disk, then for $0<r\leq 1$, $\displaystyle{\max_{|z| = r}|p(z)|} \geq \Big(\dfrac{r+1}{2}\Big)^n…

For any n-by-n complex matrix T and any $1\leqslant k\leqslant n$, let $\Lambda_{k}(T)$ the set of all $\lambda\in \C$ such that $PTP=\lambda P$ for some rank-k orthogonal projection $P$ be its higher rank-k numerical range. It is shown…

For any n-by-n complex matrix T and any $1\leqslant k\leqslant n$, let $\Lambda_{k}(T)$ the set of all $\lambda\in \C$ such that $PTP=\lambda P$ for some rank-k orthogonal projection $P$ be its higher rank-k numerical range. It is shown…

Let an algebraic polynomial $P_n(\zeta)$ of degree $n$ be such that $|P_n(\zeta)|\le 1$ for $\zeta\in E\subset\mathbb{T}$ and $|E|\ge 2\pi -s$. We prove the sharp Remez inequality $$ \sup_{\zeta\in\mathbb{T}}|P_n(\zeta)|\le…

Let $G$ be a simple graph, and denote by $\lambda(G)$ its spectral radius. Sun and Das (2020) established that for any non-isolated vertex $v$ with degree $d(v)$, \[ \lambda(G)\leq \sqrt{\lambda(G-v)^2 + 2d(v) - 1}, \] which is a conjecture…

Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. For $n \to \infty$ we obtain that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ (with…

The {\em discrepancy} of a matrix $M \in \mathbb{R}^{d \times n}$ is given by $\mathrm{DISC}(M) := \min_{\boldsymbol{x} \in \{-1,1\}^n} \|M\boldsymbol{x}\|_\infty$. An outstanding conjecture, attributed to Koml\'os, stipulates that…

We show that for every pair of matrices (S,P), having the closed symmetrized bidisc $\Gamma$ as a spectral set, there is a one dimensional complex algebraic variety $\Lambda$ in $\Gamma$ such that for every matrix valued polynomial f, the…

A matrix $A\in\mathbb{C}^{n\times n}$ is diagonalizable if it has a basis of linearly independent eigenvectors. Since the set of nondiagonalizable matrices has measure zero, every $A\in \mathbb{C}^{n\times n}$ is the limit of diagonalizable…

Consider the $2n$-by-$2n$ matrix $M=(m_{i,j})_{i,j=1}^{2n}$ with $m_{i,j} = 1$ for $i,j$ satisfying $|2i-2n-1|+|2j-2n-1| \leq 2n$ and $m_{i,j} = 0$ for all other $i,j$, consisting of a central diamond of 1's surrounded by 0's. When $n \geq…

In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…

A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in [C.Q. Li et al., A new error bound for linear complementarity problems for B-matrices.…

Consider a family of infinite tri--diagonal matrices of the form $L+ zB,$ where the matrix $L$ is diagonal with entries $L_{kk}= k^2,$ and the matrix $B$ is off--diagonal, with nonzero entries $B_{k,{k+1}}=B_{{k+1},k}= k^\alpha, 0 \leq…

In 1993, Fishburn and Graham established the following qualitative extension of the classical Erd\H{o}s-Szekeres theorem. If $N$ is sufficiently large with respect to $n$, then any $N\times N$ real matrix contains an $n\times n$ submatrix…

Consider the trilinear form for twisted convolution on $\mathbb{R}^{2d}$: \begin{equation*} \mathcal{T}_t(\mathbf{f}):=\iint f_1(x)f_2(y)f_3(x+y)e^{it\sigma(x,y)}dxdy,\end{equation*} where $\sigma$ is a symplectic form and $t$ is a…

Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that…

We prove a matrix discrepancy bound that strengthens the famous Kadison-Singer result of Marcus, Spielman, and Srivastava. Consider any independent scalar random variables $\xi_1, \ldots, \xi_n$ with finite support, e.g. $\{ \pm 1 \}$ or…

Using the log-convexity of the Gamma function and Euler's reflection formula, we give a new proof of a classical weighted sine product inequality. Two different parameter choices yield two competing upper bounds for the same product. We…

In this paper we show that, if an increasing sequence $\Lambda=(\lambda_k)_{k\in\mathbb{Z}}$ has gaps going to infinity $\lambda_{k+1}-\lambda_k\to +\infty$ when $k\to\pm\infty$, then for every $T>0$ and every sequence…

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…