Some general algorithms. I: Arithmetic groups
Some general algorithms. I: Arithmetic groups
复制标题
一些通用算法。
DOI：
10.2307/1971091
复制
发表时间：
1980
影响因子：
4.9
通讯作者：
D. Segal
中科院分区：
文献类型：
--
作者：
F. Grunewald;D. Segal
定义在Q上的n次代数矩阵群是GLN(C)的子群，GLN(C)是有限多个系数为有理的多项式在GLN(C)中的公共零点的集合，在N个矩阵项中。我们也称这样的群为n次Q-群。如果这些多项式是显式给出的，我们说Q-群是显式给定的。如果G是这样的群，且R是C的子环，则
An algebraic matrix group of degree n, defined over Q, is a subgroup of GLn(C) which is the set of common zeros in GLn(C) of finitely many polynomials, with rational coefficients, in the n2 matrix entries. We shall also call such a group a Q-group, of degree n. We say that the Q-group is given explicitly if these polynomials are explicitly given. If G is such a group and R is a subring of C, put