Ranveer Singh

collaborators

3 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 $(0, 1)$ -matrix is a well-known $# P$ -complete problem. In this paper, we present an expression for the permanent of a bipartite graph in terms of the d…

math.CO2024

Computing the permanental polynomial of $4 k$ -intercyclic bipartite graphs

Ravindra B. Bapat, Ranveer Singh, Hitesh Wankhede

Let $G$ be a bipartite graph with adjacency matrix $A (G)$ . The characteristic polynomial $ϕ (G, x) = det (x I - A (G))$ and the permanental polynomial $π (G, x) = per (x I - A (G))$ are bo…

Permanental Analog of the Rank-Nullity Theorem for Symmetric Matrices

Permanent of bipartite graphs in terms of determinants

Computing the permanental polynomial of 4k-intercyclic bipartite graphs

Computing the permanental polynomial of $4 k$ -intercyclic bipartite graphs