Minimal density conjugation of binary matrices (Q544134)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal density conjugation of binary matrices |
scientific article |
Statements
Minimal density conjugation of binary matrices (English)
0 references
14 June 2011
0 references
Let \(d(M)\) denote the density (the number of non-zero entries) of an \(n\times n\) non-singular binary matrix \(M\). The minimal density of \(M\) is defined to be: \(\delta (M)=\min \{d(LML^{-1}): L\in GL(n,2)\}\). The authors characterize the minimal density of \(M\) when \(M\) is a companion matrix of a polynomial of degree at most four. The minimal density of a Jordan block whose eigenvalues are all one has been computed. The authors show that the minimal density of an \(n\times n\) matrix is bounded above by \(3n/2\). An algorithm for computing the minimal density (when it is low) is given.
0 references
minimal density
0 references
conjugation
0 references
sparse polynomials
0 references
binary matrix
0 references
companion matrix
0 references
Jordan block
0 references
eigenvalues
0 references
algorithm
0 references