Geodesic
POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN
Glasgow mathematical journal, Tome 60 (2018) no. 1, pp. 209-218

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
ROMAN'KOV, VITALY. POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN. Glasgow mathematical journal, Tome 60 (2018) no. 1, pp. 209-218. doi: 10.1017/S0017089516000677
@article{10_1017_S0017089516000677,
     author = {ROMAN'KOV, VITALY},
     title = {POLYCYCLIC, {METABELIAN} {OR} {SOLUBLE} {OF} {TYPE} {(FP)\ensuremath{\infty}} {GROUPS} {WITH} {BOOLEAN} {ALGEBRA} {OF} {RATIONAL} {SETS} {AND} {BIAUTOMATIC} {SOLUBLE} {GROUPS} {ARE} {VIRTUALLY} {ABELIAN}},
     journal = {Glasgow mathematical journal},
     pages = {209--218},
     year = {2018},
     volume = {60},
     number = {1},
     doi = {10.1017/S0017089516000677},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089516000677/}
}
TY  - JOUR
AU  - ROMAN'KOV, VITALY
TI  - POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN
JO  - Glasgow mathematical journal
PY  - 2018
SP  - 209
EP  - 218
VL  - 60
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089516000677/
DO  - 10.1017/S0017089516000677
ID  - 10_1017_S0017089516000677
ER  - 
%0 Journal Article
%A ROMAN'KOV, VITALY
%T POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN
%J Glasgow mathematical journal
%D 2018
%P 209-218
%V 60
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089516000677/
%R 10.1017/S0017089516000677
%F 10_1017_S0017089516000677

[1] 1. Epstein, D. B. A., Cannon, J. W., Holt, D. F., Levy, S., Patterson, M. S. and Thurston, W., Word processing in groups (Jones and Bartlett, Boston, London, 1992). Google Scholar | DOI

[2] 2. Bazhenova, G., Rational sets in finitely generated nilpotent groups, Algebra Log. 39 (4) (2000), 379–394. Google Scholar | DOI

[3] 3. Gersten, S. and Short, H., Rational subgroups of biautomatic groups, Ann. Math. 134 (1991), 125–158. Google Scholar | DOI

[4] 4. Gilman, R. H., Formal languages and infinite groups, in Geometric and computational perspectives on infinite groups (Minneapolis, MN and New Brunswick, NJ, 1994), DIMACS Ser. Discrete Math. Theor. Comp. Sci., vol. 25 (American Mathematical Society, Providence, RI, 1996), 27–51. Google Scholar

[5] 5. Kargapolov, M. I. and Merzlyakov, Yu. I., Foundations of the theory of groups (Springer, New York, 1979). Google Scholar

[6] 6. Kirkinskij, A. S., Intersections of finitely generated subgroups in metabelian groups, Algebra Log. 20 (1) (1981), 24–36. Google Scholar | DOI

[7] 7. Kropholler, P. H., Soluble groups of type (FP) have finite torsion-free rank, Bull. London Math. Soc. 25 (6) (1993), 558–566. Google Scholar | DOI

[8] 8. Kropholler, P. H., Hierarchical decompositions, generalized Tate cohomology, and groups of type (FP) , in Combinatorial and geometric group theory, Edinburgh, 1993 (Duncan, A.J., Gilbert, N.D. and Howie, J., Editors), London Mathematical Society Lecture Note Series, vol. 204 (Cambridge University Press, Cambridge, UK, 1995), 190–216. Google Scholar

[9] 9. Kropholler, P. H., On groups of type (FP) , J. Pure Appl. Algebra 90 (1) (1993), 55–67. Google Scholar | DOI

[10] 10. Lennox, J. C. and Robinson, D. J. S., The theory of infinite soluble groups (Clarendon Press, Oxford, 2004). Google Scholar | DOI

[11] 11. Robinson, D. J. S., Finiteness conditions and generalized soluble groups (Springer-Verlag, Berlin, 1972). Google Scholar | DOI

Cité par Sources :