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.
This publication is cited in the following 5 articles:
V. A. Roman'kov, “Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two”, Sib. elektron. matem. izv., 19:1 (2022), 387–403
V. A. Roman'kov, “Algorithmic theory of solvable groups”, PDM, 2021, no. 52, 16–64
S. I. Adian, V. G. Durnev, “Decision problems for groups and semigroups”, Russian Math. Surveys, 55:2 (2000), 207–296
I. A. Bublichenko, A. V. Lebedev, “Influence of interference of comparable beams on readings of a two-beam laser photometer”, Meas Tech, 32:4 (1989), 294
V. P. Platonov, “The arithmetic theory of algebraic groups”, Russian Math. Surveys, 37:3 (1982), 1–62