论文信息 - Some general algorithms. I: Arithmetic groups

Some general algorithms. I: Arithmetic groups

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

Dan Segal | Fritz Grunewald | F. Grunewald | D. Segal

[1] A. Seidenberg. Constructions in algebra , 1974 .

[2] Richard G. Swan,et al. Generators and relations for certain special linear groups , 1968 .

[3] R. Lyndon,et al. Combinatorial Group Theory , 1977 .

[4] T. Ono. On Some Arithmetic Properties of Linear Algebraic Groups , 1959 .

[5] H. Matsumoto. Quelques remarques sur les groupes algébriques réels , 1964 .

[6] G. Mostow. Self-Adjoint Groups , 1955 .

[7] N. Blackburn. Conjugacy in nilpotent groups , 1965 .

[8] A. Borel,et al. Théorèmes de finitude en cohomologie galoisienne , 1964 .

[9] Armand Borel,et al. Arithmetic subgroups of algebraic groups , 1962 .

[10] J. Humphreys,et al. Linear Algebraic Groups , 1975 .

[11] F. Grunewald,et al. The solubility of certain decision problems in arithmetic and algebra , 1979 .

[12] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .

[13] J. Cassels,et al. Rational Quadratic Forms , 1978 .

[14] F. Grunewald. Solution of the Conjugacy Problem in Certain Arithmetic Groups , 1980 .