Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates

摘要

Abstract We prove that a nonsymmetric normal entry pattern of order n (n≥3) has at most n(n-3)/2+3 distinct indeterminates and up to permutation similarity this number is attained by a unique pattern which is explicitly described. An open problem is posed.

关键词