Polycyclic, metabelian or soluble of type (FP)_ groups with Boolean algebra of rational sets and biautomatic soluble groups are virtually abelian

DOI10.1017/S0017089516000677MaRDI QIDQ4600319zbMATH OpenOpenAlexFDO

Authors Vitaliĭ Roman'kov

Publication date 8 January 2018

Published in Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.00223

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Geometric group theory (20F65) Homological methods in group theory (20J05) Formal languages and automata (68Q45)

Abstract: Let $G$ be a polycyclic, metabelian or soluble of type (FP)${}_{infty}$ 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.

Recommendations

• Virtually Biautomatic Groups
• Rational subgroups of biautomatic groups
• Virtual rational Betti numbers of abelian-by-polycyclic groups.
• Rational growth in virtually abelian groups
• Finitely generated soluble groups and their subgroups.

Cites work

• scientific article; zbMATH DE number 3787040 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 2107935 (Why is no real title available?)
• scientific article; zbMATH DE number 2112655 (Why is no real title available?)
• scientific article; zbMATH DE number 848034 (Why is no real title available?)
• scientific article; zbMATH DE number 848082 (Why is no real title available?)
• scientific article; zbMATH DE number 3384295 (Why is no real title available?)
• Intersections of finitely generated subgroups in metabelian groups
• On groups of type (FP)_
• Rational subgroups of biautomatic groups
• Soluble Groups of Type (FP)∞ have Finite Torsion-Free Rank

Cited in

(6)

• Two problems for solvable and nilpotent groups
• Virtual rational Betti numbers of abelian-by-polycyclic groups.
• The Development of the Theory of Automatic Groups
• Superpositions of free Fox derivations
• Undecidability of the submonoid membership problem for free nilpotent group of class l\geqslant 2 of sufficiently large rank
• On decidability of the product of subgroups membership problem for nilpotent groups

This page was built for publication: Polycyclic, metabelian or soluble of type \((\mathrm{FP})_\infty\) groups with Boolean algebra of rational sets and biautomatic soluble groups are virtually abelian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600319)