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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.