Maximal determinants of combinatorial matrices

From MaRDI portal




Abstract: We prove that detAleq6fracn6 whenever Ain0,1nimesn 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.









This page was built for publication: Maximal determinants of combinatorial matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1641998)