Abstract: The product of subgroups membership problem for a finitely generated group is the decision problem, where, given two or more finitely generated subgroups K i , i = 1 , … , m , of and a group element , it is asked whether g ∈ ∏ m i = 1 K i . In this paper, we prove that, for any finitely generated nilpotent group of class two, the product of two subgroups membership problem is decidable. Note that this problem is equivalent to the problem of determining the non-emptiness of the intersection of two cosets of finitely generated subgroups. We also show that, for a sufficiently large direct power H n of the Heisenberg group ℍ, there exists a product K = ∏ 4 i = 1 K i of four finitely generated subgroups for which the membership problem is algorithmically undecidable. The proof of the last assertion is based on the undecidability of Hilbert’s 10th problem and interpretation of Diophantine equations in nilpotent groups. The question of decidability of the membership problem for a product of three finitely generated subgroups in a nilpotent group of class two remains open.

Cite: Roman’kov V.
On decidability of the product of subgroups membership problem for nilpotent groups
Journal of Group Theory. 2024. V.28. N2. P.463-473. DOI: 10.1515/jgth-2023-0119 WOS Scopus РИНЦ OpenAlex

Dates:

Submitted:	Jul 31, 2023
Accepted:	Jun 18, 2024
Published online:	Sep 20, 2024
Published print:	Mar 1, 2025

Identifiers:

Web of science:	WOS:001315348000001
Scopus:	2-s2.0-105001081406
Elibrary:	73801721
OpenAlex:	W4402643219

Citing: Пока нет цитирований

Altmetrics: