arXiv (All)
open access
Maximal Subsemigroups of Infinite Symmetric Inverse Monoids
The symmetric inverse monoid $I_X$ on a set $X$ consists of all bijective functions whose domain and range are subsets of $X$ under the usual composition and inversion of partial functions. For an arbitrary infinite set $X$, we classify all maximal subsemigroups and maximal inverse subsemigroups of
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
- Style, Syntax, and Gilgamesh XI 123#1053705
- The Functionalizer: Lossless Functional Decomposition for Subword Tokenization#1149470
- Low-level optimizations in high-level HDLs: Is there a benefit?#1132222
- Another remark on connexivity and set theory#112580
- Residuated bilattices#700059
Record · ID 1076749
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