Ranveer Singh

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

On Chollet's Permanent Conjecture for Graph Laplacians

Priyanshu Pant, Ranveer Singh

In 1982, Chollet conjectured that $per (A \circ B) \leq per (A) per (B)$ for Hermitian positive semidefinite matrices $A, B$ , where $\circ$ denotes the Hadamard…

math.CO2026

Permanental Energy of Graphs

Priyanshu Pant, Ranveer Singh

For a simple graph $G$ with adjacency matrix $A (G)$ , let $π (G, x) := per (x I - A (G))$ be its permanental polynomial with roots $μ_{1}, \dots, μ_{n} \in C$ , and define the pe…

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…

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…

On Chollet's Permanent Conjecture for Graph Laplacians

Permanental Energy of Graphs

Permanental Analog of the Rank-Nullity Theorem for Symmetric Matrices

Computing the permanental polynomial of 4k-intercyclic bipartite graphs

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