arXiv (All)
open access
Exact Kernel Transfer to Clique Complexes and the Hardness of Normalized Persistence
For clique complexes $X_1\subseteq X_2$, normalized persistence in degree $d$ is $\operatorname{rank}[H_d(X_1)\to H_d(X_2)]/\dim H_d(X_1)$. Estimating it requires exact endpoint homology and the inclusion-induced map, even with inverse-polynomial endpoint Laplacian gaps. We prove that additive-error
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
- Using Persistent Homology to Analyze Access to Heterogeneous-Quality Resources and Heterogeneous-Severity Nuisances#1119163
- Diagonal Multi-omics Integration of Heterogeneous Datasets#924132
- Diagonal Multi-omics Integration of Heterogeneous Datasets#919901
- $p$ and $rp$-Spectral Element Methods for Two-dimensional Elliptic Boundary Layer Problems#1077114
- Compactness of Almost Quasi-Biharmonic Maps in Dimension Four#684078
Record · ID 1154698
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