Related papers: Two new lower bounds for the smallest singular val…

Due to their importance in both data analysis and numerical algorithms, low rank approximations have recently been widely studied. They enable the handling of very large matrices. Tight error bounds for the computationally efficient…

We prove a new lower bound for the Frobenius norm of the inverse of an non-negative matrix. This bound is only a modest improvement over previous results, but is sufficient for fully resolving a conjecture of Harwitz and Sloane, commonly…

We study the least singular value of the $n\times n$ matrix $H-z$ with $H=A_0+H_0$, where $H_0$ is drawn from the complex Ginibre ensemble of matrices with iid Gaussian entries, and $A_0$ is some general $n\times n$ matrix with complex…

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

Let $\zeta = \xi + i\xi'$ where $\xi, \xi'$ are iid copies of a mean zero, variance one, subgaussian random variable. Let $N_n$ be a $n \times n$ random matrix with entries that are iid copies of $\zeta$. We prove that there exists a $c \in…

We prove an optimal estimate on the smallest singular value of a random subgaussian matrix, valid for all fixed dimensions. For an N by n matrix A with independent and identically distributed subgaussian entries, the smallest singular value…

This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions…

We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…

The goal of this note is to study the smallest conic singular value of a matrix from a Lagrangian duality viewpoint and provide an efficient method for its computation.

In this sequel to Resolution except for minimal singularities I, we find the smallest class of singularities in four variables with which we necessarily end up if we resolve singularities except for normal crossings. The main new feature is…

This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…

We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

We give a very short argument showing how the main identity from our earlier paper (Sogge and Zelditch, 2011) immediately leads to the best lower bound currently known (Colding and Minicozzi II, 2011) for the Hausdorff measure of nodal sets…

This paper concerns cheaply computable formulas and bounds for the condition number of the TLS problem. For a TLS problem with data $A$, $b$, two formulas are derived that are simpler and more compact than the known results in the…

In Communication theory and Coding, it is expected that certain circulant matrices having $k$ ones and $k+1$ zeros in the first row are nonsingular. We prove that such matrices are always nonsingular when $2k+1$ is either a power of a…

We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…

This paper gives a framework to produce the lower bound of eigenvalues defined in a Hilbert space by the eigenvalues defined in another Hilbert space. The method is based on using the max-min principle for the eigenvalue problems.

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

The best known method to give a lower bound for the Noether number of a given finite group is to use the fact that it is greater than or equal to the Noether number of any of the subgroups or factor groups. The results of the present paper…