In this talk I will discuss some instances in quantum computing where numerical range techniques arise. I will also try to formulate some open problems. Elliptical range theorems for generalized numerical ranges of quadratic operators Speaker Chi-Kwong Li, William and Mary, [email protected] Co-authors Yiu-Tung Poon, Iowa State University, [email protected]; Nung-Sing Sze, University of Connect...

As a continuation of the work on linear maps between operator algebras which preserve certain subsets of operators with finite rank, or finite corank, here we consider the problem inbetween, that is, we treat the question of preserving operators with infinite rank and infinite corank. Since, as it turns out, in this generality our preservers cannot be written in a nice form what we have got use...

in this paper we study the concept of latin-majorizati-on. geometrically this concept is different from other kinds of majorization in some aspects. since the set of all $x$s latin-majorized by a fixed $y$ is not convex, but, consists of :union: of finitely many convex sets. next, we hint to linear preservers of latin-majorization on $ mathbb{r}^{n}$ and ${m_{n,m}}$.

let a and b be n × m matrices. the matrix b is said to be g-row majorized (respectively g-column majorized) by a, if every row (respectively column) of b, is g-majorized by the corresponding row (respectively column) of a. in this paper all kinds of g-majorization are studied on mn,m, and the possible structure of their linear preservers will be found. also all linear operators t : mn,m ---> mn...

The Pólya-Schur theory describes the class of hyperbolicity preservers, i.e., the linear operators on univariate polynomials preserving realrootedness. We attempt to develop an analog of Pólya-Schur theory in the setting of linear finite difference operators. We study the class of linear finite difference operators preserving the set of real-rooted polynomials whose mesh (i.e., the minimal dist...