2 papers
math.CO2025
Permanental Analog of the Rank-Nullity Theorem for Symmetric Matrices
Priyanshu Pant, Surabhi Chakrabartty, Ranveer Singh
The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of th…
cs.DM2025
Permanent of bipartite graphs in terms of determinants
Surabhi Chakrabartty, Ranveer Singh
Computing the permanent of a -matrix is a well-known -complete problem. In this paper, we present an expression for the permanent of a bipartite graph in terms of the d…