Algorithms in Linear Algebraic Groups
Group Theory
2020-05-19 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.2003.06292,
title = {Algorithms in Linear Algebraic Groups},
author = {Sushil Bhunia and Ayan Mahalanobis and Pralhad Shinde and Anupam Singh},
journal= {arXiv preprint arXiv:2003.06292},
year = {2020}
}
Comments
arXiv admin note: text overlap with arXiv:1901.00892, arXiv:1504.03794