Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8897767 | Linear Algebra and its Applications | 2018 | 21 Pages |
Abstract
We prove that detâ¡Aâ¤6n6 whenever Aâ{0,1}nÃn contains at most 2n ones. We also prove an upper bound on the determinant of matrices with the k-consecutive ones property, a generalisation of the consecutive ones property, where each row is allowed to have up to k blocks of ones. Finally, we prove an upper bound on the determinant of a path-edge incidence matrix in a tree and use that to bound the leaf rank of a graph in terms of its order.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Henning Bruhn, Dieter Rautenbach,