Related papers: On the S-matrix conjecture

The low-rank matrix approximation problem is ubiquitous in computational mathematics. Traditionally, this problem is solved in spectral or Frobenius norms, where the accuracy of the approximation is related to the rate of decrease of the…

We present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank…

High-dimensional inference refers to problems of statistical estimation in which the ambient dimension of the data may be comparable to or possibly even larger than the sample size. We study an instance of high-dimensional inference in…

Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix $M$, the goal is to compute a matrix $M'$ of given rank $r$ in a linear or affine…

We study the problem of finding the nearest $\Omega$-stable matrix to a certain matrix $A$, i.e., the nearest matrix with all its eigenvalues in a prescribed closed set $\Omega$. Distances are measured in the Frobenius norm. An important…

In a 1987 paper, Eliahou and Kervaire constructed a minimal resolution of a class of monomial ideals in a polynomial ring, called stable ideals. As a consequence of their construction they deduced several homological properties of stable…

A conjectural formula for the minimum weight of Schubert codes was conjectured by Ghorpade in 2000. This was established by Xiang in 2008. In 2018, Ghorpade and Singh provided a new proof of this conjecture. Moreover, they also conjectured…

The Chow ring of a matroid (or more generally, atomic latice) is an invariant whose importance was demonstrated by Adiprasito, Huh and Katz, who used it to resolve the long-standing Heron-Rota-Welsh conjecture. Here, we make a detailed…

Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [IFF 2001, IO 2009].…

We analyze a class of estimators based on convex relaxation for solving high-dimensional matrix decomposition problems. The observations are noisy realizations of a linear transformation $\mathfrak{X}$ of the sum of an approximately) low…

Let $S\neq\mathbb N$ be a numerical semigroup with Frobenius number $f$, genus $g$ and embedding dimension $e$. In 1978 Wilf asked the question, whether $\frac{f+1-g}{f+1}\geq\frac1e$. As is well known, this holds in the cases $e=2$ and…

We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and…

Perturbation theory is developed to analyze the impact of noise on data and has been an essential part of numerical analysis. Recently, it has played an important role in designing and analyzing matrix algorithms. One of the most useful…

Buchweitz-Greuel-Schreyer conjectured in 1987 a lower bound on the ranks of matrix factorizations over certain local hypersurface rings. We study a graded version of this conjecture, and we show that it implies a novel conjecture concerning…

We prove optimal sparsity oracle inequalities for the estimation of covariance matrix under the Frobenius norm. In particular we explore various sparsity structures on the underlying matrix.

We give a new proof of the Caffarelli contraction theorem, which states that the Brenier optimal transport map sending the standard Gaussian measure onto a uniformly log-concave probability measure is Lipschitz. The proof combines a recent…

We investigate the spectral norms of symmetric $N \times N$ matrices from two pseudo-random ensembles. The first is the pseudo-Wigner ensemble introduced in "Pseudo-Wigner Matrices" by Soloveychik, Xiang and Tarokh and the second is its…

For a matrix $A \in Z^{k \times n}$ of rank $k$, the diagonal Frobenius number $F_{\text{diag}}(A)$ is defined as the minimum $t \in Z_{\geq 1}$, such that, for any $b \in \text{span}_{Z}(A)$, the condition \begin{equation*} \exists x \in…

For an oriented graph $D$, the inversion of $X\subseteq V(D)$ in $D$ is the graph obtained by reversing the orientation of all arcs with both ends in $X$. The inversion number $\mathrm{inv}(D)$ is the minimum number of inversions needed to…

We consider the problem of computing the closest stable/unstable non-negative matrix to a given real matrix. This problem is important in the study of linear dynamical systems, numerical methods, etc. The distance between matrices is…