Sushil Bhunia, Ayan Mahalanobis, Pralhad Shinde, Anupam Singh
Published 2020-03-12Version 1
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.
Comments: arXiv admin note: text overlap with arXiv:1901.00892, arXiv:1504.03794
On the spinor norm in the unitary groups
Growth in linear algebraic groups and permutation groups: towards a unified perspective
Algorithms and topology for Cayley graphs of groups
![QR code for arXiv:2003.06292 [math.GR]](http://oss.arxitics.com/images/favicon.svg)