Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4568| Title: | Algorithms in Linear Algebraic Groups |
| Authors: | Bhunia, Sushil MAHALANOBIS, AYAN SHINDE, PRALHAD SINGH, ANUPAM KUMAR Dept. of Mathematics |
| Keywords: | Symplectic similitude group Orthogonal similitude group Word problem Gaussian elimination Spinor norm Double coset decomposition TOC-APR-2020 2020 2020-APR-WEEK5 |
| Issue Date: | Jul-2020 |
| Publisher: | Springer Nature |
| Citation: | Advances in Applied Clifford Algebras, 30(3). |
| 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. |
| URI: | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4568 https://doi.org/10.1007/s00006-020-01054-y |
| ISSN: | 0188-7009 1661-4909 |
| Appears in Collections: | JOURNAL ARTICLES |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.