Related papers: Maximum of the resolvent over matrices with given …
We propose a simple generalization of the matrix resolvent to a resolvent for real symmetric tensors $T\in \otimes^p \mathbb{R}^N$ of order $p\ge 3$. The tensor resolvent yields an integral representation for a class of tensor invariants…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…
We study the limiting eigenvalue distribution of $n\times n$ banded Toeplitz matrices as $n\to \infty$. From classical results of Schmidt-Spitzer and Hirschman it is known that the eigenvalues accumulate on a special curve in the complex…
Source enumeration typically relies on subspace-based techniques that require accurate separation of signal and noise subspaces. However, prior works do not address coherent sources in small uniform linear arrays, where ambiguities arise in…
Motivated by applications in single-cell biology and metagenomics, we investigate the problem of matrix reordering based on a noisy disordered monotone Toeplitz matrix model. We establish the fundamental statistical limit for this problem…
Let $E$ be a complex Banach lattice and $T$ is an operator in the centrum $Z(E)=\{T: |T|\le \lambda I \mbox{ for some } \lambda\}$ of $E$. Then the essential norm $\|T\|_{e}$ of $T$ equals the essential spectral radius $r_{e}(T)$ of $T$. We…
This paper concerns parameterized convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional Banach (resp. finite-dimensional) spaces and that are indexed by an arbitrary fixed set T…
We consider the problem of estimating the spectral norm of a matrix using only matrix-vector products. We propose a new Counterbalance estimator that provides upper bounds on the norm and derive probabilistic guarantees on its…
Let $A$ be a full ranked $ n\times n$ matrix, with singular values $\sigma_1 (A) \ge \dots \ge \sigma_n (A) >0$. The condition number $\kappa(A):= \sigma_1(A)/\sigma_n(A)=\|A\|\cdot \|A\|^{-1}$ is a key parameter in the analysis of…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…
In this paper, we consider the problem of seriation of a permuted structured matrix based on noisy observations. The entries of the matrix relate to an expected quantification of interaction between two objects: the higher the value, the…
We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…
A matrix completion problem is to recover the missing entries in a partially observed matrix. Most of the existing matrix completion methods assume a low rank structure of the underlying complete matrix. In this paper, we introduce an…
The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that need to be changed in order to obtain a matrix of rank at most $r$. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit…
The analysis of the spectral features of a Toeplitz matrix-sequence $\left\{T_{n}(f)\right\}_{n\in\mathbb N}$, generated by a symbol $f\in L^1([-\pi,\pi])$, real-valued almost everywhere (a.e.), has been provided in great detail in the last…
We show that every self--adjoint matrix B of trace 0 can be realized as B=T+T^* for a nilpotent matrix T of norm no greater than K times the norm of B, for a constant K that is independent of matrix size. More particularly, if D is a…
Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a class of Toeplitz graphs, and will be denoted by…
In this paper we describe the asymptotic behaviour of the spectral norm of the product of two finite Toeplitz matrices as the matrix dimension goes to the infinity. These Toeplitz matrices are generated by positive functions with…
We study a class of rotation invariant determinantal ensembles in the complex plane; examples include the eigenvalues of Gaussian random matrices and the roots of certain families of random polynomials. The main result is a criteria for a…