|
This article is cited in 5 scientific papers (total 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.
Received: 28.12.1979
Citation:
R. A. Sarkisyan, “Algorithmic questions for linear algebraic groups. II”, Math. USSR-Sb., 41:3 (1982), 329–359
Linking options:
https://www.mathnet.ru/eng/sm2803https://doi.org/10.1070/SM1982v041n03ABEH002236 https://www.mathnet.ru/eng/sm/v155/i3/p400
|
Statistics & downloads: |
Abstract page: | 388 | Russian version PDF: | 123 | English version PDF: | 25 | References: | 82 |
|