arXiv (All)
open access
A Hierarchical Online-Compression Approach to Proportional Subsets of Bounded Orthonormal Systems
Let $(ϕ_i)_{i=1}^n$ be an orthonormal system on a probability space with $\|ϕ_i\|_\infty\leq L$. We prove that, for every $2\leq k<n$, there is a set $I$ of at least $n-k$ indices such that $$ \|f\|_2\leq CM_k\sqrt{\log(e+M_k)}\|f\|_1 $$ for every $f$ in the span of $(ϕ_i)_{i\in I}$, where $M_k=L\sq
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
- Learning by Compression: Risk Estimates Attain the Law-of-Large-Numbers Rate#1297794
- Asymptotically Optimal List Size of Random Linear Codes#821054
- On a problem of Nathanson related to strongly minimal asymptotic bases of order $h$#1143466
- An Elementary Proof of the First LP Bound on the Rate of Binary Codes / Nati Linial, Elyassaf Loyfer#1188578
- List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$#1123425
Record · ID 1490095
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