Polycyclic, metabelian or soluble of type (FP) groups with boolean algebra of rational sets and biautomatic soluble groups are virtually abelian
arXiv:1511.00223 · doi:10.1017/S0017089516000677
Abstract
Let be a polycyclic, metabelian or soluble of type (FP) group such that the class of all rational subsets of is a boolean algebra. Then is virtually abelian. Every soluble biautomatic group is virtually abelian.