Some nilpotent, tridiagonal matrices with a special sign pattern (Q417539): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: H. S. Yoon / rank | |||
Normal rank | |||
Property / review text | |||
A sign pattern is an \(n\times n\) matrix whose entries are chosen from \(\{ -, 0, + \}\). A real matrix \(A\) has a sign pattern \(S\) if in positions corresponding to \(-\) in \(S\), the entry in \(A\) is negative, in positions corresponding to \(+\) in \(S\), the entry in \(A\) is positive and the rest of the entries in \(A\) are \(0\). A sign pattern \(S\) is called a spectrally arbitrary pattern, if for each real monic polynomial \(r(x)\) of degree \(n\), there exists a matrix sign pattern \(S\) and with characteristic polynomial \(r(x)\). In this paper, the authors establish the existence of a nilpotent matrix \(A_{n}\) with sign pattern \(\mathcal{T}_{n}\), which was introduced by [\textit{J. H. Drew, C. R. Johnson, D. D. Olesky} and \textit{P. van den Driessche}, Linear Algebra Appl. 308, No. 1-3, 121--137 (2000; Zbl 0957.15012)], for \(n\geq 2\). This paper does not directly address the issue of whether or not \(\mathcal{T}_{n}\) is a spectrally arbitrary pattern. The authors prove that a certain matrix is nilpotent by constructing a change of basis matrix that makes it strictly upper triangular. They do this using Chebyshev polynomials of the first kind \(\mathcal{T}_{n}(x)\). | |||
Property / review text: A sign pattern is an \(n\times n\) matrix whose entries are chosen from \(\{ -, 0, + \}\). A real matrix \(A\) has a sign pattern \(S\) if in positions corresponding to \(-\) in \(S\), the entry in \(A\) is negative, in positions corresponding to \(+\) in \(S\), the entry in \(A\) is positive and the rest of the entries in \(A\) are \(0\). A sign pattern \(S\) is called a spectrally arbitrary pattern, if for each real monic polynomial \(r(x)\) of degree \(n\), there exists a matrix sign pattern \(S\) and with characteristic polynomial \(r(x)\). In this paper, the authors establish the existence of a nilpotent matrix \(A_{n}\) with sign pattern \(\mathcal{T}_{n}\), which was introduced by [\textit{J. H. Drew, C. R. Johnson, D. D. Olesky} and \textit{P. van den Driessche}, Linear Algebra Appl. 308, No. 1-3, 121--137 (2000; Zbl 0957.15012)], for \(n\geq 2\). This paper does not directly address the issue of whether or not \(\mathcal{T}_{n}\) is a spectrally arbitrary pattern. The authors prove that a certain matrix is nilpotent by constructing a change of basis matrix that makes it strictly upper triangular. They do this using Chebyshev polynomials of the first kind \(\mathcal{T}_{n}(x)\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Süleyman Güler / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15B05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A18 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6034504 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
sign pattern | |||
Property / zbMATH Keywords: sign pattern / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spectrum | |||
Property / zbMATH Keywords: spectrum / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tridiagonal matrix | |||
Property / zbMATH Keywords: tridiagonal matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nilpotent matrix | |||
Property / zbMATH Keywords: nilpotent matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spectrally arbitrary | |||
Property / zbMATH Keywords: spectrally arbitrary / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Chebyshev polynomial | |||
Property / zbMATH Keywords: Chebyshev polynomial / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
characteristic polynomial | |||
Property / zbMATH Keywords: characteristic polynomial / rank | |||
Normal rank |
Revision as of 20:57, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some nilpotent, tridiagonal matrices with a special sign pattern |
scientific article |
Statements
Some nilpotent, tridiagonal matrices with a special sign pattern (English)
0 references
14 May 2012
0 references
A sign pattern is an \(n\times n\) matrix whose entries are chosen from \(\{ -, 0, + \}\). A real matrix \(A\) has a sign pattern \(S\) if in positions corresponding to \(-\) in \(S\), the entry in \(A\) is negative, in positions corresponding to \(+\) in \(S\), the entry in \(A\) is positive and the rest of the entries in \(A\) are \(0\). A sign pattern \(S\) is called a spectrally arbitrary pattern, if for each real monic polynomial \(r(x)\) of degree \(n\), there exists a matrix sign pattern \(S\) and with characteristic polynomial \(r(x)\). In this paper, the authors establish the existence of a nilpotent matrix \(A_{n}\) with sign pattern \(\mathcal{T}_{n}\), which was introduced by [\textit{J. H. Drew, C. R. Johnson, D. D. Olesky} and \textit{P. van den Driessche}, Linear Algebra Appl. 308, No. 1-3, 121--137 (2000; Zbl 0957.15012)], for \(n\geq 2\). This paper does not directly address the issue of whether or not \(\mathcal{T}_{n}\) is a spectrally arbitrary pattern. The authors prove that a certain matrix is nilpotent by constructing a change of basis matrix that makes it strictly upper triangular. They do this using Chebyshev polynomials of the first kind \(\mathcal{T}_{n}(x)\).
0 references
sign pattern
0 references
spectrum
0 references
tridiagonal matrix
0 references
nilpotent matrix
0 references
spectrally arbitrary
0 references
Chebyshev polynomial
0 references
characteristic polynomial
0 references