Characterizing invertible matrices with {0,1} entries - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-21T16:29:43Z http://mathoverflow.net/feeds/question/20534 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/20534/characterizing-invertible-matrices-with-0-1-entries Characterizing invertible matrices with {0,1} entries boolean number 2010-04-06T18:45:23Z 2012-12-02T01:44:46Z <p>Related to the question <a href="http://mathoverflow.net/questions/18636/number-of-invertible-0-1-real-matrices" rel="nofollow">link text</a> I was asking myself some time ago the following. Can one precisely describe the invertible n\times n matrices with{0, 1} entries? For example, is anything special about the graph asociated to this matrix?</p> http://mathoverflow.net/questions/20534/characterizing-invertible-matrices-with-0-1-entries/20559#20559 Answer by Gerhard Paseman for Characterizing invertible matrices with {0,1} entries Gerhard Paseman 2010-04-06T22:39:26Z 2010-04-06T22:39:26Z <p>You are unlikely to find a characterization which does not result from simple facts in linear algebra. I am unaware of any characterizations which make interesting statements about graphs.</p> <p>You may want to choose the ring over which the matrices belong. For example, the same matrix may be invertible over the reals, but if it has even determinant, then it is not invertible over the field of two elements. You can say that, given a matrix A, the parallelipiped associated with the rows (or columns) of A is nontrivial (has nonzero volume in R^n) iff the matrix is invertible over the reals, but this is a simple consequence of a geometric interpretation of determinant; it doesn't give anything new. Also, the eigenvalues of the adjacency matrix of a directed graph are all nonzero precisely when said matrix is invertible over the reals; big hairy tautological deal, as I am just saying a matrix is invertible when its determinant is nonzero.</p> <p>Consider the ring above fixed, and look at the {0,1}-matrices over that ring which are invertible. This set includes some lower triangular matrices, some upper triangular matrices, some "comb matrices" where you take an invertible matrix and alternately add an extra row and column, picking one of them to be mostly zeros and the other mostly 1's, while making the diagonal all 1's, and alternating between rows and columns. In addition to these patterns, you have some block matrices, incidence geometries, certain combinatorial designs, and so on, all belonging to the class of invertible {0,1}- matrices, and looking pretty woolly as a set. The attendant directed graphs will be a similarly woolly-looking set of graphs.</p> <p>Given the above, it may be possible to describe the class of graphs in an interesting way. For example, if you build the matrices by augmentation, consider the corresponding operation for adding a vertex and certain edges to a graph. You may be able to prove facts about the set of graphs so constructed, especially as a set of representatives of isomorphism classes of graphs. I just don't think the result will look pretty, appealing, or useful without a major shift in perspective.</p> <p>Gerhard "Ask Me About System Design" Paseman, 2010.04.06</p> http://mathoverflow.net/questions/20534/characterizing-invertible-matrices-with-0-1-entries/115135#115135 Answer by Felix Goldberg for Characterizing invertible matrices with {0,1} entries Felix Goldberg 2012-12-02T01:44:46Z 2012-12-02T01:44:46Z <p>At least for symmetric matrices, such graphs have been studied under the name <em>singular graphs</em>. See, for instance, <a href="http://212.189.136.211/journals/ELA/ela-articles/articles/vol16_pp451-462.pdf" rel="nofollow">this paper</a>.</p>