Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates

Zejun Huang; Xingzhi Zhan

doi:10.1016/j.laa.2015.08.003

Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates

Zejun Huang
, Xingzhi Zhan^*

^*Corresponding author for this work

School of Mathematical Sciences

Hunan University

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

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.

Original language	English
Article number	13316
Pages (from-to)	359-371
Number of pages	13
Journal	Linear Algebra and Its Applications
Volume	485
DOIs	https://doi.org/10.1016/j.laa.2015.08.003
State	Published - 17 Aug 2015

Keywords

0-1 matrix
Entry pattern
Normal matrix

Access to Document

10.1016/j.laa.2015.08.003

Cite this

@article{d63a91900c3c46a18a1cee49959570bc,

title = "Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates",

abstract = "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.",

keywords = "0-1 matrix, Entry pattern, Normal matrix",

author = "Zejun Huang and Xingzhi Zhan",

note = "Publisher Copyright: {\textcopyright} 2015 Published by Elsevier Inc.",

year = "2015",

month = aug,

day = "17",

doi = "10.1016/j.laa.2015.08.003",

language = "英语",

volume = "485",

pages = "359--371",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates

AU - Huang, Zejun

AU - Zhan, Xingzhi

PY - 2015/8/17

Y1 - 2015/8/17

N2 - 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.

AB - 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.

KW - 0-1 matrix

KW - Entry pattern

KW - Normal matrix

UR - https://www.scopus.com/pages/publications/84939225616

U2 - 10.1016/j.laa.2015.08.003

DO - 10.1016/j.laa.2015.08.003

M3 - 文章

AN - SCOPUS:84939225616

SN - 0024-3795

VL - 485

SP - 359

EP - 371

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

M1 - 13316

ER -

Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this