Zero patterns and unitary similarity
Representation Theory
2010-06-15 v2
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.
Cite
@article{arxiv.0807.3580,
title = {Zero patterns and unitary similarity},
author = {Jinpeng An and Dragomir Z. Djokovic},
journal= {arXiv preprint arXiv:0807.3580},
year = {2010}
}
Comments
39 pages