Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates
classification
🧮 math.CO
keywords
distinctentryindeterminatesnonsymmetricnormalnumberpatternattained
read the original abstract
We prove that a nonsymmetric normal entry pattern of order $n$ ($n\ge 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.