Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates

DOI10.1016/J.LAA.2015.08.003zbMATH Open1322.05031arXiv1506.03514OpenAlexW584841218MaRDI QIDQ745201FDOQ745201

Authors: Xingzhi Zhan, Zejun Huang 

Publication date: 13 October 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We prove that a nonsymmetric normal entry pattern of order $n$ ($nge3$) 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.

Full work available at URL: https://arxiv.org/abs/1506.03514

Recommendations

• Almost-nonsingular entry pattern matrices
• Sign-nonsingular skew-symmetric matrices with the most nonzero entries
• The number of equivalence classes of symmetric sign patterns
• Possible numbers of nonzero entries in a matrix with a given term rank
• Integrally normalizable matrices and zero-nonzero patterns

zbMATH Keywords

normal matrix0-1 matrixentry pattern

Mathematics Subject Classification ID

Basic linear algebra (15A99) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Toeplitz, Cauchy, and related matrices (15B05) Extremal combinatorics (05D99)

Cites Work

• Matrix theory
• Handbook of linear algebra
• Sign patterns of nonnegative normal matrices

Cited In (3)

• Symmetric matrices whose entries are linear functions
• On the maximum rank of completions of entry pattern matrices
• Almost-nonsingular entry pattern matrices

This page was built for publication: Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745201)