Ask a Question

Prefer a chat interface with context about you and your work?

POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)<sub>โˆž</sub> GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN

POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)<sub>โˆž</sub> GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN

Abstract Let G be a polycyclic, metabelian or soluble of type (FP) โˆž group such that the class Rat ( G ) of all rational subsets of G is a Boolean algebra. Then, G is virtually abelian. Every soluble biautomatic group is virtually abelian.