Algorithms in Linear Algebraic Groups

03/12/2020
by   Sushil Bhunia, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset