arXiv (All)
open access
Quantitative decomposition and approximation for quasi-local operators
We develop a quantitative approach to quasi-local operators with bounded block-rank. Our main results are a quantitative decomposition for quasi-local operators into block-rank-one pieces and a quantitative finite-propagation approximation in the block-rank-one case, leading to a quantitative proof
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
- Cross-Shift Analysis for Unrelated-Machine Weighted Completion Time A (1.3168+epsilon)-Approximation#616658
- Cross-Shift Analysis for Unrelated-Machine Weighted Completion Time A (1.3168+epsilon)-Approximation#616158
- Bounds-Constrained Finite Element Approximation of Time-Dependent Partial Differential Equations#822334
- Guaranteed inf-sup bounds and existence verification for semilinear elliptic problems via nonconforming finite elements#1070812
- Rank-One Matrix Discrepancy and Algorithmic Kadison--Singer#1123644
Record · ID 1048399
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