Article
Keywords:
Toeplitz matrix; Toeplitz inverse; Toeplitz powers; principal minor; Fibonacci sequence
Summary:
Let $a$, $b$ and $c$ be fixed complex numbers. Let $M_n(a,b,c)$ be the $n\times n$ Toeplitz matrix all of whose entries above the diagonal are $a$, all of whose entries below the diagonal are $b$, and all of whose entries on the diagonal are $c$. For $1\leq k\leq n$, each $k\times k$ principal minor of $M_n(a,b,c)$ has the same value. We find explicit and recursive formulae for the principal minors and the characteristic polynomial of $M_n(a,b,c)$. We also show that all complex polynomials in $M_n(a,b,c)$ are Toeplitz matrices. In particular, the inverse of $M_n(a,b,c)$ is a Toeplitz matrix when it exists.
References:
[1] Griffin, K.:
Solving the principal minor assignment problem and related computations. PhD. Dissertation Washington State University Washington (2006).
MR 2709319
[2] Griffin, K., Tsatsomeros, M. J.:
Principal minors, Part I: A method for computing all the principal minors of a matrix. Linear Algebra Appl. 419 (2006), 107-124.
MR 2263114
[3] Griffin, K., Tsatsomeros, M. J.:
Principal minors, Part II: The principal minor assignment problem. Linear Algebra Appl. 419 (2006), 125-171.
MR 2263115