Related papers: On minimal norms on $M_n$

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…

Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…

Every state on the algebra $M_n$ of complex nxn matrices restricts to a state on any matrix system. Whereas the restriction to a matrix system is generally not open, we prove that the restriction to every *-subalgebra of $M_n$ is open. This…

The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…

For $U\in O(N)$ we have $||U||_1\leq N\sqrt{N}$, with equality if and only if $U=H/\sqrt{N}$, with $H$ Hadamard matrix. Motivated by this remark, we discuss in this paper the algebraic and analytic aspects of the computation of the maximum…

Given $n+1$ unit vectors in $\mathbf{R}^n$ or $\mathbf{C}^n,$ consider the absolute values of the determinants of the vectors taken $n$ at a time. By taking a geometric perspective, we show that the minimum of these determinants is…

Every sufficiently big matrix with small spectral norm has a nearby low-rank matrix if the distance is measured in the maximum norm (Udell & Townsend, SIAM J Math Data Sci, 2019). We use the Hanson--Wright inequality to improve the estimate…

Let $\mathcal{A}$ be a finite set of $d\times d$ matrices with integer entries and let $m_n(\mathcal{A})$ be the maximum norm of a product of $n$ elements of $\mathcal{A}$. In this paper, we classify gaps in the growth of…

For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon,…

Let $\A$ be the operator which assigns to each $m \times n$ matrix-valued function on the unit circle with entries in $H^\infty + C$ its unique superoptimal approximant in the space of bounded analytic $m \times n$ matrix-valued functions…

A result of Nayak asserts that $\underset{m\to \infty}\lim |A^m|^{1/m}$ exists for each $n\times n$ complex matrix $A$, where $|A| = (A^*A)^{1/2}$, and the limit is given in terms of the spectral decomposition. We extend the result of…

We estimate the number of principal ideals $ I $ of norm $ \mathrm{N}(I) \leq x $ in the family of the simplest cubic fields. The advantage of our result is that it provides the correct order of magnitude for arbitrary $ x \geq 1 $, even…

The bad science matrix problem consists in finding, among all matrices $A \in \mathbb{R}^{n \times n}$ with rows having unit $\ell^2$ norm, one that maximizes $\beta(A) = \frac{1}{2^n} \sum_{x \in \{-1, 1\}^n} \|Ax\|_\infty$. Our main…

Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $\phi:M_{mn}\rightarrow M_{mn}$…

The condition number of solutions to full rank linear least-squares problem are shown to be given by an optimization problem that involves nuclear norms of rank 2 matrices. The condition number is with respect to the least-squares…

Let $N\ge 4$. We show that, if $x_1,\dots,x_N$ and $y_1,\dots,y_N$ are $N$-tuples of strictly positive numbers whose arithmetic, geometric and harmonic means agree, then \[ \max_j x_j <(N-2)\max_j y_j \quad\text{and}\quad \min_j x_j…

We present a preliminary study of Schur norms $\|M\|_{S}=\max\{ \|M\circ C\|: \|C\|=1\}$, where M is a matrix whose entries are $\pm1$, and $\circ$ denotes the entrywise (i.e., Schur or Hadamard) product of the matrices. We show that, if…

We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem min |sigma(F(X)-G)|_alpha + |C(X)- d|_beta subject to A(X)-b in Q; where sigma(X) denotes the vector of singular values of X,…

We determine those norms on B(H) whose unit ball is C*-convex. We call them M-norms and show that the class of M-norms less than a given norm enjoys a maximum element. These minimum and maximum elements will be determined in some cases.…

We construct a normed algebra ${\calA}$ with norm $N(\cdot)$ over the reals, which is {\em quadrative} in the sense that $N(A^2) \le N(A)^2$ for all $A \in {\cal A}$, but is not 3-{\em bounded} in the sense that $N(A^3) \le N(A)^3$. This…