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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.