arXiv (All)
open access
Every countable group embeds in a group of type $\mathrm{FP}_n$
For every integer $n\ge2$, we prove that every countable group embeds in a group of type $\mathrm{FP}_n$. We also construct a group of type $\mathrm{F}_n$ containing a copy of every recursively presented group. Consequently, a finitely generated group embeds in a group of type $\mathrm{F}_n$ if and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Infinite simple groups with no proper abnormal subgroups#1129075
- On the finiteness of certain soluble groups#490086
- Finite Soluble Groups Need Not Admit Increasing Unrefinable Subgroup Chains#1062128
- Sequence entropy and independence in free and minimal actions#1048480
- Criteria for discrete decomposability and admissibility in the branching problem#974034
Record · ID 1141881
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive