Polycyclic, metabelian or soluble of type (FP)$_{\infty}$ groups with boolean algebra of rational sets and biautomatic soluble groups are virtually abelian
Vitaly Roman'kov

TL;DR
This paper proves that certain classes of groups, including polycyclic, metabelian, and soluble groups with specific properties, are virtually abelian, and also shows that all soluble biautomatic groups are virtually abelian.
Contribution
It establishes that groups with a boolean algebra of rational subsets are virtually abelian and proves that all soluble biautomatic groups are virtually abelian.
Findings
Groups with boolean algebra of rational subsets are virtually abelian
All soluble biautomatic groups are virtually abelian
The results unify properties of rational sets and automatic groups in group theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
