no. 17 · Wednesday 18 November 2026
The Inverse Symplectic Eigenvalue Problem of a Graph
Abstract
Symplectic geometry plays an increasingly important role in mathematics, physics, and applications. The concept of symplectic eigenvalues, whose existence for positive definite matrices is known as Williamson's Theorem, naturally gives rise to inverse problems. We introduce the inverse symplectic eigenvalue problem for positive definite matrices described by a labeled graph and solve it for several families and all labeled graphs of order four. We develop various tools such as the Strong Symplectic Spectral Property (SSSP) together with its consequences, graph couplings to describe collections of labelings of a graph that produce the same symplectic eigenvalues, and coupled graph zero forcing. We establish numerous results for symplectic positive definite matrices, including a sharp lower bound on the number of nonzero entries of such an irreducible matrix (or equivalently, the number of edges in its graph). This lower bound is a consequence of a lower bound on the sum of the number of nonzero entries in an irreducible positive definite matrix and its inverse.
- comments
- 44 pages, 5 figures
- fields
- Combinatorics