Extremal sparsity of the companion matrix of a polynomial (Q1932635)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Extremal sparsity of the companion matrix of a polynomial
scientific article

    Statements

    Extremal sparsity of the companion matrix of a polynomial (English)
    0 references
    0 references
    0 references
    21 January 2013
    0 references
    Let \(C\) be the companion matrix of a monic polynomial \(p\) over a field \(\mathbb F\). The authors prove that if \(A\) is a matrix whose entries are rational functions of the coefficients of \(p\) over \(\mathbb F\) and whose characteristic polynomial is \(p\), then \(A\) has at least as many nonzero entries as \(C\). In other words, the companion matrix is the sparsest matrix of the mentioned set of matrices \(A\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial
    0 references
    companion matrix
    0 references
    sparsity
    0 references
    spanning branching
    0 references
    transcendence degree
    0 references
    0 references