{"paper":{"title":"Residually finite algorithmically finite groups, their subgroups and direct products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO","math.RA"],"primary_cat":"math.GR","authors_text":"Anton A. Klyachko, Ayrana K. Mongush","submitted_at":"2014-02-04T21:28:33Z","abstract_excerpt":"We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is \"very infinite\" and \"very algorithmically finite\" in the sense that $G$ contains an infinite abelian normal subgroup while all finite Cartesian powers of $G$ are algorithmically finite (i.e., for any positive integer $n$, there is no algorithm which writes out an infinite sequence of pairwise different elements of $G^n$). We also state several related problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0887","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}