arXiv (All)
open access
Conjugacy problems in higher-dimensional Thompson groups
We prove that topological conjugacy of elements of the Brin--Thompson group $nV$ is undecidable for every $n\geq2$. From a Turing machine $T$, the reduction produces two elements of $nV$, which are conjugate by an involution in $nV$ if $T$ halts on the empty tape. If $T$ does not halt on the empty t
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
- The Robust Thompson's Conjecture for Alternating Groups#1106152
- On Thompson groups for Ważewski dendrites#350707
- Hurwitz Equivalence of Reflection Factorizations in Types $B$ and $D$#1063271
- Finite groups with a unique real $2$-block#1033973
- Watkins's conjecture holds for all infinite groups#1155984
Record · ID 1248051
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