Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates
Combinatorics
2015-06-12 v1
Abstract
We prove that a nonsymmetric normal entry pattern of order () has at most distinct indeterminates and up to permutation similarity this number is attained by a unique pattern which is explicitly described.
Cite
@article{arxiv.1506.03514,
title = {Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates},
author = {Zejun Huang and Xingzhi Zhan},
journal= {arXiv preprint arXiv:1506.03514},
year = {2015}
}