Related papers: Numerical Ranges of KMS Matrices

We characterize under what conditions $n\times n$ Hermitian matrices $A_1$ and $A_2$ have the property that the spectrum of $\cos t A_1 + \sin t A_2$ is independent of $t$ (thus, the trigonometric pencil $\cos t A_1 + \sin t A_2$ is…

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…

Tridiagonal matrices with constant main diagonal and reciprocal pairs of off-diagonal entries are considered. Conditions for such matrices with sizes up to 6-by-6 to have elliptical numerical ranges are obtained.

Let $A = [a_{i j}]_{i,j=1}^n$ be a nonnegative matrix with $a_{1 1} = 0$. We prove some lower bounds for the spread $s(A)$ of $A$ that is defined as the maximum distance between any two eigenvalues of $A$. If $A$ has only two distinct…

A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…

This paper solves the following problem about Hermitian matrices related to the theory of $2$-structures:\emph{ }Let $n$ be a positive integer and $k$ be an integer with $k\in \{3,\ldots,n-3\}$. Characterize the Hermitian matrices $A$ such…

Criterion for a companion matrix to have a certain number of flat portions on the boundary of its numerical range is given. The criterion is specialized to the cases of 3-by-3 and 4-by-4 matrices. In the latter case, it is proved that a…

K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive…

Motivated by applications in quantum information and quantum control, a new type of $C$"-numerical range, the relative $C$"-numerical range denoted $W_K(C,A)$, is introduced. It arises upon replacing the unitary group U(N) in the definition…

The matricial range of the $2\times2$ matrix $E_{21}$ (i.e., the $2\times 2$ unilateral shift) is described very simply: it consists of all matrices with numerical radius at most $1/2$. The known proofs of this simple statement, however,…

A frequency square is a square matrix in which each row and column is a permutation of the same multiset of symbols. A frequency square is of type $(n;\lambda)$ if it contains $n/\lambda$ symbols, each of which occurs $\lambda$ times per…

We provide a sufficient condition for the numerical range of a nilpotent matrix N to be circular in terms of the existence of cycles in an undirected graph associated with N. We prove that if we add to this matrix N a diagonal real matrix…

Let $K_0$ be a compact convex subset of the plane $\mathbb R^2$, and assume that $K_1\subseteq \mathbb R^2$ is similar to $K_0$, that is, $K_1$ is the image of $K_0$ with respect to a similarity transformation $\mathbb R^2\to\mathbb R^2$.…

Let $C$ be an $[n,k]$ linear code chosen uniformly at random over a finite field $\mathbb{F}_q$ of size $q$. The following asymptotic probability of $C$ being maximum distance separable (MDS) as $q,n,k\to\infty$ is known: If…

For a given set of $n\times n$ matrices $\mathcal F$, we study the union of the $C$-numerical ranges of the matrices in the set $\mathcal F$, denoted by $W_C({\mathcal F})$. We obtain basic algebraic and topological properties of…

Let $W_n$ denote the wheel graph having $n$-vertices. If $i$ and $j$ are any two vertices of $W_n$, define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and} ~j~ \mbox{are adjacent} \\ 2 & \mbox{else}. \end{cases}\]…

Lomonaco and Kauffman developed knot mosaics to give a definition of a quantum knot system. This definition is intended to represent an actual physical quantum system. A knot $n$-mosaic is an $n \times n$ matrix of 11 kinds of specific…

An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q_n such that every vector x in Q_n can be obtained from some vector c in C by changing at most R 1's of c to 0's, where R is as small as possible.…

Let {a_s(mod n_s)}_{s=1}^k (k>1) be a finite system of residue classes with the moduli n_1,...,n_k distinct. By means of algebraic integers we show that the range of the covering function w(x)=|{1\le s\le k: x=a_s (mod n_s)}| is not…

We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…