arXiv (All)
open access
The Additive Arithmetic of Linear Orders
We present a systematic development of the arithmetic of the class of linear orders under the ordered sum $(LO, +)$ and prove a number of new results. Our approach is based on a Euclidean algorithm for pairs of linear orders that almost additively commute. Among our results: (i.) We generalize a
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
- On the Sum of Additive Characters and its Applications over Finite Fields#617835
- On the Sum of Additive Characters and its Applications over Finite Fields#617335
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)#1033960
- On Normality Preserving Operations#1051071
- Compressed commuting graphs of matrix rings#999142
Record · ID 971861
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