arXiv (All)
open access
The word problem in verbal products of groups
We prove that nilpotent and metabelian products of groups with decidable word problem have decidable word problem. In contrast, we exhibit families of groups with decidable word problem for which their solvable product have undecidable word problem. In doing so, we exhibit hyperbolic groups with und
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
- Characterisations of finite groups with exponent $q$ via their power graphs#662238
- Characterisations of finite groups with exponent $q$ via their power graphs#661188
- MULTIPLE AGENT FORMALISMS FOR COORDINATION IN ORGANIZATIONAL PROBLEMS#933490
- The modified predicate theory of proper names#765699
- Same Quantity, Different Answer: Numerical Representation Invariance in Language Models#1051502
Record · ID 1105847
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