Algorithms in Linear Algebraic Groups
| dc.contributor.author | Bhunia, Sushil | |
| dc.date.accessioned | 2020-12-21T06:34:43Z | |
| dc.date.available | 2020-12-21T06:34:43Z | |
| dc.date.issued | 2020 | |
| dc.description | Only IISERM authors are available in the record. | |
| dc.description.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. | en_US |
| dc.identifier.citation | Advances in Applied Clifford Algebras, 30(3) | en_US |
| dc.identifier.other | https://doi.org/10.1007/s00006-020-01054-y | |
| dc.identifier.uri | https://link.springer.com/article/10.1007%2Fs00006-020-01054-y | |
| dc.identifier.uri | http://hdl.handle.net/123456789/3262 | |
| dc.language.iso | en | en_US |
| dc.publisher | Birkhauser | en_US |
| dc.subject | Symplectic similitude group | en_US |
| dc.subject | Orthogonal similitude group | en_US |
| dc.subject | Word problem | en_US |
| dc.subject | Gaussian elimination | en_US |
| dc.subject | Spinor norm | en_US |
| dc.subject | Double coset decomposition | en_US |
| dc.title | Algorithms in Linear Algebraic Groups | en_US |
| dc.type | Article | en_US |