Residually finite algorithmically finite groups, their subgroups and direct products (original) (raw)

Abstract

We construct a finitely generated infinite recursively presented residually finite algorithmically finite group G, thus answering a question of Myasnikov and Osin. The group G here is “strongly infinite” and “strongly algorithmically finite,” which means that G contains an infinite Abelian normal subgroup and all finite Cartesian powers of G are algorithmically finite (i.e., for any n, there is no algorithm writing out infinitely many pairwise distinct elements of the group G n). We also formulate several open questions concerning this topic.

Access this article

Log in via an institution

Subscribe and save

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Myasnikov and D. Osin, “Algorithmically finite groups,” J. Pure Appl. Algebra 215 (11), 2789–2796 (2011). arXiv: 1012.1653
    Article MathSciNet MATH Google Scholar
  2. B. Khoussainov and A. Miasnikov, “Finitely presented expansions of groups, semigroups, and algebras,” Trans. Amer. Math. Soc. 366 (3), 1455–1474 (2014).
    Article MathSciNet MATH Google Scholar
  3. E. S. Golod and I. R. Shafarevich, “On class field towers,” Izv. Akad. Nauk SSSR Ser. Mat. 28 (2), 261–272 (1964) [Amer. Math. Soc. Transl. (2) 48, 91–102 (1965)].
    MathSciNet MATH Google Scholar
  4. M. Ershov, “Golod–Shafarevich groups: a survey,” Int. J. Algebra Comput. 22 (5), 1230001 (2012), arXiv: 1206.0490.
    Article MathSciNet Google Scholar

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, Moscow, Russia
    A. A. Klyachko & A. K. Mongush

Authors

  1. A. A. Klyachko
    You can also search for this author inPubMed Google Scholar
  2. A. K. Mongush
    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence toA. A. Klyachko.

Additional information

Original Russian Text © A. A. Klyachko, A. K. Mongush, 2015, published in Matematicheskie Zametki, 2015, Vol. 98, No. 3, pp. 372–377.

Rights and permissions

About this article

Cite this article

Klyachko, A.A., Mongush, A.K. Residually finite algorithmically finite groups, their subgroups and direct products.Math Notes 98, 414–418 (2015). https://doi.org/10.1134/S0001434615090060

Download citation

Keywords