arXiv (All)
open access
Polycyclic groups and profinite isomorphism
The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem for the class of virtually polycyclic groups.
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
- Finite Non-$p$-Groups with 5 Automorphism Orbits#1155721
- The algebraic lattice isomorphism problem#1367011
- A Classification of Small MSTD Sets in Arbitrary Fields#1131649
- NOETHER: A Constructive Framework for Metamorphic Pattern Discovery from Operator Algebras#200568
- On hyperbolic lattices whose reduced automorphism group is virtually abelian#1156197
Record · ID 1325165
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