Related papers: The Correlation Numerical Range of a Matrix and Co…
The unitary correlation sets defined by the first author in conjunction with tensor products of $\mathcal{U}_{nc}(n)$ are further studied. We show that Connes' embedding problem is equivalent to deciding whether or not two smaller versions…
The numerical radius of a matrix is a scalar quantity that has many applications in the study of matrix analysis. Due to the difficulty in computing the numerical radius, inequalities bounding it have received a considerable attention in…
The paper explores further the computation of the quaternionic numerical range of a complex matrix. We prove a modified version of a conjecture by So and Tompson. Specifically, we show that the shape of the quaternionic numerical range for…
We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…
We consider the correlation functions of eigenvalues of a unidimensional chain of large random hermitian matrices. An asymptotic expression of the orthogonal polynomials allows to find new results for the correlations of eigenvalues of…
In this paper we explore a class of equivalence relations over $\N^\ast$ from which is constructed a sequence of symetric matrices related to the Mertens function. From numerical experimentations we suggest a conjecture, about the growth of…
We consider higher-rank versions of the standard numerical range for matrices. A central motivation for this investigation comes from quantum error correction. We develop the basic structure theory for the higher-rank numerical ranges, and…
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as…
Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…
In this paper we explore a family of congruences over $\N^\ast$ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments, we formulate a conjecture about the growth of…
We obtain a sufficient condition for the convexity of quaternionic numerical range for complex matrices in terms of its complex numerical range. It is also shown that the Bild coincides with complex numerical range for real matrices. From…
The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…
It has been shown that if $T$ is a complex matrix, then {\small\begin{align*} \omega(T)&=\frac{1}{n}\sup\left\{|\mathrm{Tr}\ X|;\ X\in W^n(T)\right\}\\ &=\frac{1}{n}\sup\left\{\|X\|_1;\ X\in W^n(T)\right\}\\ &= \sup\left\{ \omega(X);\ X\in…
We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…
Which convex subsets of the complex plane are the numerical range W(A of some matrix A? This paper gives a precise characterization of these sets. In addition to this we show that for any A there exists a symmetric matrix B of the same size…
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…
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
We prove the \textbf{NP}-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the $n\times n$ rank-one matrices over $\{0,1\}$. The problems are: membership,…
We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…
This chapter is an introduction to the connection between random matrices and maps, i.e graphs drawn on surfaces. We concentrate on the one-matrix model and explain how it encodes and allows to solve a map enumeration problem.