Related papers: When is the Resolvent Like a Rank One Matrix?
In this paper we are concerned with resolvent estimates for the Laplacian $\Delta$ in Euclidean spaces. Uniform resolvent estimates for $\Delta$ were shown by Kenig, Ruiz and Sogge \cite{KRS} who established rather a complete description of…
We make a detailed analysis of the A-hypergeometric system (or GKZ system) associated with a monomial curve and integral, hence resonant, exponents. We characterize the Laurent polynomial solutions and show that these are the only rational…
E. B. Davies et B. Simon have shown (among other things) the following result: if T is an n\times n matrix such that its spectrum \sigma(T) is included in the open unit disc \mathbb{D}=\{z\in\mathbb{C}:\,|z|<1\} and if…
Let P be a set of n points in $\mathbb{R}^d$. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than $dn\over d+1$ points of P. We call a point x a strong centerpoint for a family of…
Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets of the space that do not admit solutions of the system…
The pseudospectra (or spectral instability) of non-selfadjoint operators is a topic of current interest in applied mathematics. In fact, for non-selfadjoint operators the resolvent could be very large outside the spectrum, making the…
This paper is devoted to the study of a semiclassical "black box" operator $P$. We estimate the norm of its resolvent truncated near the trapped set by the norm of its resolvent truncated on rings far away from the origin. For $z$ in the…
We show that the global minimum solution of $\lVert A - BXC \rVert$ can be found in closed-form with singular value decompositions and generalized singular value decompositions for a variety of constraints on $X$ involving rank, norm,…
In the first part of this paper we study a best approximation of a vector in Euclidean space R^n with respect to a closed semi-algebraic set C and a given semi-algebraic norm. Assuming that the given norm and its dual norm are…
For a matrix $T \in M_m(\mathbb{C})$, let $|T| : = \sqrt{T^*T}$. For $A \in M_m(\mathbb{C})$, we show that the matrix sequence $\big\{ |A^n|^{\frac{1}{n}} \big\}_{n \in \mathbb{N}}$ converges in norm to a positive-semidefinite matrix $H$…
In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…
The Crouzeix ratio $\psi(A)$ of an $N\times N$ complex matrix $A$ is the supremum of $\|p(A)\|$ taken over all polynomials $p$ such that $|p|\le 1$ on the numerical range of $A$. It is known that $\psi(A)\le 1+\sqrt{2}$, and it is…
In this article, we shall construct the resolvent of Laplacian at high energies near the spectrum on non-product conic manifolds with a single cone tip. Microlocally, the resolvent kernel is the sum of b-pseudodifferential operators,…
Symmetry arises often when learning from high dimensional data. For example, data sets consisting of point clouds, graphs, and unordered sets appear routinely in contemporary applications, and exhibit rich underlying symmetries.…
We study the question of finding the maximal determinant of matrices of odd order with entries {-1,1}. The most general upper bound on the maximal determinant, due to Barba, can only be achieved when the order is the sum of two consecutive…
The higher rank numerical range is closely connected to the construction of quantum error correction code for a noisy quantum channel. It is known that if a normal matrix $A \in M_n$ has eigenvalues $a_1, \..., a_n$, then its higher rank…
Given a closed subscheme $Z$ in a smooth variety $X$, defined by the maximal minors of an $s\times r$ matrix of regular functions, with $s\geq r$, we consider the corresponding incidence correspondence $W$ in $Y=X\times {\mathbf P}^{r-1}$,…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
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…
This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear norm, does not in general return the solution for this…