arXiv (All)
open access
Quantum polynomial-time conjugacy in metabelian groups
We prove that the conjugacy problem in finitely presented metabelian groups with a fixed number of generators is solvable in bounded-error quantum polynomial time, uniformly in the defining relations of the group. Both the group presentation and the words representing the elements are part of the in
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
- Nilpotent quandles#1201819
- Universally extendible characters#1355439
- On the classification of finite GK-dimensional pre-Nichols algebras and quasi-quantum groups#155557
- Intertwining operators for representations of covering groups of reductive $p$-adic groups#1217263
- Conjugator Length in the Baumslag-Gersten Group#972940
Record · ID 1402638
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