arXiv (All)
open access
Asymptotic completions of preordered semirings
The study of preordered semirings is motivated by applications in computer science, graph theory, and information theory, and provides tools for understanding the asymptotic preorder, which compares large powers of a pair of elements. This paper studies sequences which behave approximately as sequen
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
- Erratum to "Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands"#670241
- Erratum to "Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands"#668176
- Maximal Kolmogorov Complexity in a Hamming Ball#998897
- The length of a piece of string: Where the whole is more than the sum of its constituent parts.#327070
- Asymptotic and Arithmetic Aspects of Generalized Colored Overpartitions#1144664
Record · ID 1105579
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