arXiv (All)
open access
Term Coding and Dispersion: Exact and Asymptotic Decision Problems
Let t be a tuple of r terms that, under an interpretation on an n-element alphabet A, defines a map from k-tuples over A to r-tuples over A. We study the decision theory of its maximum image size, separating exact perfect dispersion from asymptotic rate. Building on the term-cut theorem of Riis an
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
- Bayesian Efficient Coding#10030
- Improved Lower Bounds on the Capacity of the Binary Deletion Channel via a Learning Approach to Run-Length Inputs#1051305
- An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem#792456
- An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem#788456
- Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set#1012810
Record · ID 820352
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