The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 1541 –
1560 of
3024
Complementing the work of Baksalary and Trenkler [2], we announce some results characterizing the core matrix partial ordering.
We prove that on , there is no n-supercyclic operator with 1 ≤ n < ⌊(N + 1)/2⌋, i.e. if has an n-dimensional subspace whose orbit under is dense in , then n is greater than ⌊(N + 1)/2⌋. Moreover, this value is optimal. We then consider the case of strongly n-supercyclic operators. An operator is strongly n-supercyclic if has an n-dimensional subspace whose orbit under T is dense in , the nth Grassmannian. We prove that strong n-supercyclicity does not occur non-trivially in finite...
We derive several numerical radius inequalities for 2 × 2 operator matrices. Numerical radius inequalities for sums and products of operators are given. Applications of our inequalities are also provided.
Currently displaying 1541 –
1560 of
3024