Algorithms in Linear Algebraic Groups

被引:0
|
作者
Bhunia, Sushil [1 ]
Mahalanobis, Ayan [2 ]
Shinde, Pralhad [2 ]
Singh, Anupam [2 ]
机构
[1] IISER Mohali, Sect 81, Manauli 140306, Punjab, India
[2] IISER Pune, Dr Homi Bhabha Rd, Pune 411008, Maharashtra, India
关键词
Symplectic similitude group; Orthogonal similitude group; Word problem; Gaussian elimination; Spinor norm; Double coset decomposition;
D O I
10.1007/s00006-020-01054-y
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页数:23
相关论文
共 50 条