Centralizers of the complex orthogonal and symplectic group
Abstract
We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and Hamiltonian matrices, respectively. These groups are conjugate to groups of certain nonsingular block matrices whose blocks are rectangular block Toeplitz.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.