相关论文: On the S-matrix conjecture

We study subset selection for matrices defined as follows: given a matrix $\matX \in \R^{n \times m}$ ($m > n$) and an oversampling parameter $k$ ($n \le k \le m$), select a subset of $k$ columns from $\matX$ such that the pseudo-inverse of…

We consider the signal detection problem in the Gaussian design trace regression model with low rank alternative hypotheses. We derive the precise (Ingster-type) detection boundary for the Frobenius and the nuclear norm. We then apply these…

In many applications it is useful to replace the Moore-Penrose pseudoinverse (MPP) by a different generalized inverse with more favorable properties. We may want, for example, to have many zero entries, but without giving up too much of the…

In this work we construct an optimal linear shrinkage estimator for the covariance matrix in high dimensions. The recent results from the random matrix theory allow us to find the asymptotic deterministic equivalents of the optimal…

J.J. Schaeffer proved that for $any$ induced matrix norm and $any$ invertible $T=T(n)$ the inequality \[\left|\det T\right|\left\Vert T^{-1}\right\Vert \leq\mathcal{S}\left\Vert T\right\Vert ^{n-1}\] holds with…

Leveraging tools from convex analysis and incorporating additional singular value information of matrices, we completely resolve the problem of establishing perturbation bounds for the Frobenius norm of subunitary and positive polar…

I. M. Milin proposed, in his 1971 paper, a system of inequalities for the logarithmic coefficients of normalized univalent functions on the unit disk of the complex plane. This is known as the Lebedev-Milin conjecture and implies the…

The Hahn-Banach theorem states that onto each line in every normed space, there is a unitary projection, and Kadec and Snobar proved (using John's ellipsoid) that onto each $n$-dimensional subspace of any real normed space, there is a…

In this paper, we derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition (or singular value decomposition). While this approximation is well-known to be optimal with…

In 1952, Littlewood stated a conjecture about the average growth of spherical derivatives of polynomials, and showed that it would imply that for entire function of finite order, "most" preimages of almost all points are concentrated in a…

We consider a variety of criteria for selecting k representative columns from a real mxn matrix A, when sufficiently few columns are required, i.e., 1<= k<= min{rank(A), m/3}. The criteria include the following optimization problems:…

In 1987 Hiroshi Maehara conjectured that a graph can be represented by vectors considered adjacent when not orthogonal (a faithful orthogonal representation) in codimension the minimum degree of the graph. Without settling the conjecture,…

We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f…

This is the second part of a two-paper series on generalized inverses that minimize matrix norms. In Part II we focus on generalized inverses that are minimizers of entrywise p norms whose main representative is the sparse pseudoinverse for…

This is the first paper of a two-long series in which we study linear generalized inverses that minimize matrix norms. Such generalized inverses are famously represented by the Moore-Penrose pseudoinverse (MPP) which happens to minimize the…

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

Minimum numbers decide e.g. whether a given map f: S^m --> S^n/G from a sphere into a spherical space form can be deformed to a map f' such that f(x) not equal f'(x) for all x in S^m. In this paper we compare minimum numbers to…

The matrix Markov inequality by Ahlswede was stated using the Loewner anti-order between positive definite matrices. Wang use this to derive several other Chebyshev and Chernoff-type inequalities (Hoeffding, Bernstein, empirical Bernstein)…

We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…

For self-similar sets $X,Y\subseteq \mathbb{R}$, we obtain new results towards the affine embeddings conjecture of Feng-Huang-Rao (2014), and the equivalent weak intersections conjecture. We show that the conjecture holds when the defining…