This article is cited in 5 papers

Algorithmic questions for linear algebraic groups. II

R. A. Sarkisyan


Abstract: It is proved that, given a linear algebraic group defined over an algebraic number field and satisfying certain conditions, there exists an algorithm which determines whether or not two double cosets of a special type coincide in its adele group, and which enumerates all such double cosets. This result is applied to the isomorphism problem for finitely generated nilpotent groups, and also to other problems.
Bibliography: 18 titles.

UDC: 519.4

MSC: Primary 20G30, 20G35; Secondary 03F65

Received: 28.12.1979

 English version: Mathematics of the USSR-Sbornik, 1982, 41:3, 329–359

Bibliographic databases:

• 
•