Minimum number of non-zero-entries in a $7\times 7$ stable matrix
Combinatorics
2018-05-24 v1
Abstract
We prove that if a matrix is potentially stable, then it has at least 11 non-zero entries. The results for matrix with up to 6 are known previously. We prove the result by making a list of possible associated digraphs with at most 10 edges, and then use algebraic conditions to show all of these digraphs or matrices cannot be potentially stable. In relation to this, we also determine the minimum number of edges in a strongly connected digraph depending on its circumference.
Cite
@article{arxiv.1805.09004,
title = {Minimum number of non-zero-entries in a $7\times 7$ stable matrix},
author = {Christopher Hambric and Chi-Kwong Li and Diane Christine Pelejo and Junping Shi},
journal= {arXiv preprint arXiv:1805.09004},
year = {2018}
}