Algorithms in Linear Algebraic Groups

March 12, 2020 Β· Declared Dead Β· πŸ› Advances in Applied Clifford Algebras

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sushil Bhunia, Ayan Mahalanobis, Pralhad Shinde, Anupam Singh arXiv ID 2003.06292 Category math.GR Cross-listed cs.DS Citations 1 Venue Advances in Applied Clifford Algebras Last Checked 3 months ago
Abstract
This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double coset decomposition with respect to a Siegel maximal parabolic subgroup, which is important in computing infinite-dimensional representations for some algebraic groups.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.GR

Died the same way β€” πŸ‘» Ghosted