Gaussian Elimination in Symplectic and split orthogonal groups
Abstract
This paper studies an algorithm similar to that of Gaussian elimination in symplectic and orthogonal groups. We discuss two applications of this algorithm in computational group theory. One computes the spinor norm and the other computes the double coset decomposition with respect to Siegel maximal parabolic subgroup.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.