Extensions of a problem of Paul Erdös on groups

Journal of the Australian Mathematical Society

John C. Lennox¹ 

[1] James Wiegold

关键词: 20 F 16;    20 E 25;   

DOI  :  10.1017/S1446788700024253

学科分类：数学（综合）

来源: Cambridge University Press

【 摘 要 】

The main results are as follows. A finitely generated soluble group G is polycyclic if and only if every infinite set of elements of G contains a pair generating a polycyclic subgroup; and the same result with “polycyclic” replaced by “coherent”.

【 授权许可】

Unknown