Related papers: On Kippenhahn curves of low rank partial isometrie…

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.

The higher rank numerical ranges of generic matrices are described in terms of the components of their Kippenhahn curves. Cases of tridiagonal (in particular, reciprocal) 2-periodic matrices are treated in more detail.

We study linear operators on a finite-dimensional space whose Kippenhahn curves consist of concentric circles centered at the origin. We say that such operators have Circularity property. One class of examples is rotationally invariant…

By definition, reciprocal matrices are tridiagonal $n$-by-$n$ matrices $A$ with constant main diagonal and such that $a_{i,i+1}a_{i+1,i}=1$ for $i=1,\ldots,n-1$. For $n\leq 6$, we establish criteria under which the numerical range…

Reciprocal matrices are tridiagonal matrices $(a_{ij})_{i,j=1}^n$ with constant main diagonal and such that $a_{i,i+1}a_{i+1,i}=1$ for $i=1,\ldots,n-1$. For these matrices, criteria are established under which their Kippenhahn curves…

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.…

Gau, Wang and Wu in their LAMA'2016 paper conjectured (and proved for $n\leq 4$) that an $n$-by-$n$ partial isometry cannot have a circular numerical range with a non-zero center. We prove that this statement holds also for $n=5$.

Kippenhahn's Theorem asserts that the numerical range of a matrix is the convex hull of a certain algebraic curve. Here, we show that the joint numerical range of finitely many Hermitian matrices is similarly the convex hull of a…

Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range,…

The notion of fractional minimal rank of a partial matrix is introduced, a quantity that lies between the triangular minimal rank and the minimal rank of a partial matrix. The fractional minimal rank of partial matrices whose bipartite…

We examine the ranks of a subfamily of curves in a previous article, which are derived from the existence of solutions to certain Pell equations. We exhibit an abundance of curves of moderately large rank, and prove under mild conditions…

Kippenhahn discovered a real algebraic plane curve whose convex hull is the numerical range of a matrix. The correctness of this theorem was called into question when Chien and Nakazato found an example where the spatial analogue fails.…

We prove a variant of the Chance-McDuff conjecture for pseudo-rotations: under certain additional conditions, a closed symplectic manifold which admits a Hamiltonian pseudo-rotation must have deformed quantum product and, in particular,…

We address a conjecture that $\pi_1$-surjective maps between closed aspherical 3-manifolds having the same rank on $\pi_1$ must be of non-zero degree. The conjecture is proved for Seifert manifolds, which is used in constructing the first…

The quaternionic numerical range of matrices over the ring of quaternions is not necessarily convex. We prove Toeplitz-Hausdorff like theorem, that is, for any given quaternionic matrix every section of its quaternionic numerical range is…

We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds…

The elliptical range theorem asserts that the field of values (or numerical range) of a two-by-two matrix with complex entries is an elliptical disk, the foci of which are the eigenvalues of the given matrix. Many proofs of this result are…

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…

Let $M\subset\mathbb{R}^3$ be a properly embedded, connected, complete surface with boundary a convex planar curve $C$, satisfying an elliptic equation $H=f(H^2-K)$, where $H$ and $K$ are the mean and the Gauss curvature respectively -…

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…