Related papers: Numerical Ranges of KMS Matrices

A real persymmetric Jacobi matrix of order $n$ whose eigenvalues are $2k^2$ $(k=0, ..., n-1)$ is presented, with entries given as explicit functions of $n$. Besides the possible use for testing forward and inverse numerical algorithms, such…

Hermitian mass matrices for the up and down quarks with texture zeroes but with the minimum number of parameters, ten, are investigated. We show how these {\em minimum parameter} forms can be obtained from a general set of hermitian…

We study {\em sign-restricted matrices} (SRMs), a class of rectangular $(0, \pm 1)$-matrices generalizing the alternating sign matrices (ASMs). In an SRM each partial column sum, starting from row 1, equals 0 or 1, and each partial row sum,…

In their LAMA'2016 paper Gau, Wang and Wu conjectured that a partial isometry $A$ acting on $\mathbb{C}^n$ cannot have a circular numerical range with a non-zero center, and proved this conjecture for $n\leq 4$. We prove it for operators…

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…

For a finite abstract simplicial complex G with n sets, define the n x n matrix K(x,y) which is the number of subsimplices in the intersection of x and y. We call it the counting matrix of G. Similarly as the connection matrix L which is…

The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Let $n,k$ be fixed natural numbers with $1\le k\le n$ and let $A_{n+1,k,2k,\dots,sk}$ denote an $(n+1)\times (n+1)$ complex multidiagonal matrix having $s=[n/k]$ sub- and superdiagonals at distances $k,2k,\dots,sk$ from the main diagonal.…

Anderson's theorem states that if the numerical range W(A) of an n-by-n matrix A is contained in the unit disk and intersects with the unit circle at more than n points, then it coincides with the (closed) unit dissk. An analogue of this…

We prove, in some cases in term of kippenhahn curve, that if 5-by-5 partial isometry whose numerical range is a circular disc then its center is must be the origin. This gives a partial affirmative answer of the Conjecture 5.1. of [H. l.…

In this article, we are going to search for $n\times n$ matrices $A$ and $B$ such that their generalized numerical range $$W_A(B)=\{tr(AU^*BU) \ :\ U^*U=UU^*=I\}$$ is convex. More specifically, we consider $A=\hat{A}\oplus I_k$ and…

Let ${\mathcal H}$ be a complex Hilbert space and let ${\mathcal B}({\mathcal H})$ be the algebra of all bounded linear operators on ${\mathcal H}$. For a positive integer $k$ less than the dimension of ${\mathcal H}$ and ${\mathbf A} =…

We study containment and uniqueness problems concerning matrix convex sets. First, to what extent is a matrix convex set determined by its first level? Our results in this direction quantify the disparity between two product operations,…

Matrix regularity is a key to various problems in applied mathematics. The sufficient conditions, used for checking regularity of interval parametric matrices, usually fail in case of large parameter intervals. We present necessary and…

Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…

Let $n$ be a fixed integer with $n\geq 2$. For $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a cycle. So $||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}$. For…

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…