# POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN

@article{Romankov2015POLYCYCLICMO, title={POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN}, author={Vitaly Roman’kov}, journal={Glasgow Mathematical Journal}, year={2015}, volume={60}, pages={209 - 218} }

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.

## 3 Citations

### Two Problems for Solvable and Nilpotent Groups

- MathematicsAlgebra and Logic
- 2021

Section 1 gives a brief review of known results on embeddings of solvable, nilpotent, and polycyclic groups in 2-generated groups from these classes, including the description of the author’s…

### Two Problems for Solvable and Nilpotent Groups

- MathematicsAlgebra and Logic
- 2021

Section 1 gives a brief review of known results on embeddings of solvable, nilpotent, and polycyclic groups in 2-generated groups from these classes, including the description of the author’s…

### The development of the theory of automatic groups

- Mathematics
- 2022

We describe the development of the theory of automatic groups. We begin with a historical introduction, deﬁne the concepts of automatic, biautomatic and combable groups, derive basic properties, then…

## References

SHOWING 1-10 OF 17 REFERENCES

### Rational subgroups of biautomatic groups

- Mathematics
- 1991

Centralizers of finite subsets in biautomatic groups are them- selves biautomatic. Every polycyclic subgroup of a biautomatic group is abelian by finite.

### Finiteness conditions and generalized soluble groups

- Mathematics
- 1972

1. Fundamental Concepts in the Theory of Infinite Groups.- 2. Soluble and Nilpotent Groups.- 3. Maximal and Minimal Conditions.- 4. Finiteness Conditions on Conjugates and Commutators.- 5. Finiteness…

### Formal languages and infinite groups

- MathematicsGeometric and Computational Perspectives on Infinite Groups
- 1994

This article is an introduction to formal languages from the point of view of combinatorial group theory and language classes are defined algebraically.

### Word processing in groups

- Mathematics
- 1992

This study in combinatorial group theory introduces the concept of automatic groups and is of interest to mathematicians and computer scientists and includes open problems that will dominate the research for years to come.

### Merzlyakov, Foundations of the theory of groups (Springer

- New York,
- 1979

### Rational sets in finitely generated nilpotent groups

- Mathematics
- 2000

We deal with a class of rational subsets of a group, that is, the least class of its subsets which contains all finite subsets and is closed under taking union. a product of two sets, and under…