Related papers: The k-rank numerical radii

The notion of the higher rank numerical range $\Lambda_{k}(L(\lambda))$ for matrix polynomials $L(\lambda)=A_{m}\lambda^{m}+...+A_{1}\lambda+A_{0}$ is introduced here and some fundamental geometrical properties are investigated. Further,…

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…

A presentation of numerical range for rectangular matrices is undertaken in this paper, introducing two different definitions and elaborating basic properties. Then we are extended to the treatment of rank-k numerical range.

For a positive integer $k$, the rank-$k$ numerical range $\Lambda_k(A)$ of an operator $A$ acting on a Hilbert space $\cH$ of dimension at least $k$ is the set of scalars $\lambda$ such that $PAP = \lambda P$ for some rank $k$ orthogonal…

In this article the well known "Perron-Frobenius theory" is investigated involving the higher rank numerical range $\Lambda_{k}(A)$ of an irreducible and entrywise nonnegative matrix $A$ and extending the notion of elements of maximum…

We prove that two n-by-n matrices A and B have their rank-k numerical ranges $\Lambda_k(A)$ and $\Lambda_k(B)$ equal to each other for all k, $1\le k\le \lfloor n/2\rfloor+1$, if and only if their Kippenhahn polynomials…

In this article, we are going to introduce the weighted numerical range which is a further generalization both the c-numerical range and the rank k numerical range. If the boundaries of weighted numerical ranges of two matrices (possibly of…

Let $n$ and $k$ be two positive integers with $k\leq n$ and $C$ an $n \times n$ matrix with nonnegative entries. In this paper, the rank-$k$ numerical range in the max algebra setting is introduced and studied. The related notions of the…

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…

The connection between the commutativity of a family of $n\times n$ matrices and the generalized joint numerical ranges is studied. For instance, it is shown that ${\cal F}$ is a family of mutually commuting normal matrices if and only if…

Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…

For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…

Here we show that for $k\in \mathbb N,$ the closure of the $k$-rank numerical range of a contraction $A$ acting on an infinite-dimensional Hilbert space $\mathcal{H}$ is the intersection of the closure of the $k$-rank numerical ranges of…

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…

For $\mathbb N^*:=\mathbb N \setminus \{0\}$, we consider the collection $\mathfrak M(N)$ of all the $N$ rows, for which, for $n=1,\cdots,N$, the $n-th$ row consists of an increasing sequence $(a_j^n)_j$ of real numbers. For $\mathfrak A…

Given a row-finite $k$-graph $\Lambda$ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*(\Lambda)$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*(\Lambda)$. The…

For any given Cuntz semigroup, we introduce a function associated to it, called the ``Rank Ratio Function". This function ensures global control over the oscillation of the rank of any pair of elements in the Cuntz semigroup and, also,…

A vertex k-ranking is a labeling of the vertices of a graph with integers from 1 to k so any path connecting two vertices with the same label will pass through a vertex with a greater label. The rank number of a graph is defined to be the…

Suppose that c is a linear operator acting on an n-dimensional complex Hilbert Space H, and let tau denote the normalized trace on B(H). Set b_1 = (c+c*)/2 and b_2 = (c-c*)/2i, and write B for the the spectral scale of {b_1, b_2} with…

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…