arXiv (All)
open access
Converse symplectic interlacing via low-rank singular value perturbations
The symplectic interlacing theorem states that the symplectic spectrum of a $2n \times 2n$ real symmetric positive definite matrix satisfies a $2k$-step interlacing relation with the symplectic spectrum of every $2(n-k) \times 2(n-k)$ $s$-principal submatrix. We prove the converse in this paper. Mor
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Smooth manifolds in $G_{n,2}$ and $\mathbb{C} P^{N}$ defined by symplectic reductions of $T^n$-action#1123937
- Small symplectic $4$-manifolds via contact gluing and some applications#1386170
- Polynomiality of Subdimensions of Diagonal Harmonics and a Sharp Stability Bound#665504
- Polynomiality of Subdimensions of Diagonal Harmonics and a Sharp Stability Bound#664004
- 5D Runge-Lenz Vector from Symplectic Reduction of 8D Harmonic Oscillator#1403545
Record · ID 1458846
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive