arXiv (All)
open access
Conjugacy and period in symmetric diagram groups
We show how to solve the conjugacy (search) problem and the problem of determining whether a given element is periodic in symmetric diagram groups based on finite semigroup presentations.
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
- Reduction of the group isomorphism problem to the group automorphism problem#984832
- Solvable groups defined by redundant cyclic presentations#986488
- Conjugacy in Abstract Semigroups, Transformation and Diagram Monoids, and Conjugacy Growth#180494
- Conjugacy in Abstract Semigroups, Transformation and Diagram Monoids, and Conjugacy Growth#179632
- Conjugacy in Abstract Semigroups, Transformation and Diagram Monoids, and Conjugacy Growth#179237
Record · ID 1201268
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