arXiv (All)
open access
Finite bases and joins for semirings defined by the divisibility order
We study additively idempotent semirings obtained from commutative words by equipping their subwords with the divisibility order. Every finite semiring associated with a power of one letter is finitely based, whereas one associated with a linear word is finitely based exactly when the word has lengt
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
- Inherently nonfinitely based additively idempotent semirings#1064185
- The Finite Basis Problem for Semirings of Order Four#1144667
- The finite basis problem for additively idempotent semirings of order four, IV#1116483
- On inversion sets of joins in weak Bruhat order#1051888
- The finite basis problem for the power semirings of finite groups#616931
Record · ID 1062292
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