Abstract
A subspace of the space, L(n), of traceless complex matrices can be specified by requiring that the entries at some positions be zero. The set, , of these positions is a (zero) pattern and the corresponding subspace of L(n) is denoted by . A pattern is universal if every matrix in L(n) is unitarily similar to some matrix in . The problem of describing the universal patterns is raised, solved in full for , and partial results obtained for . Two infinite families of universal patterns are constructed. They give two analogues of Schur's triangularization theorem.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.