arXiv (All)
open access
Green languages and growth of free inverse monoids
Motivated by recent work on conjugacy languages in groups, we introduce a general framework for studying \emph{languages of representatives} associated to equivalence relations on finitely generated semigroups. After developing this notion in full generality, we particularize it to Green's relations
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
- Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups#1034337
- 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
- Conjugacy in Abstract Semigroups, Transformation and Diagram Monoids, and Conjugacy Growth#179039
Record · ID 1129845
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