arXiv (OAI Expanded)
open access
Complex Matching Distance and Stability for Minimal Projective Resolutions, with Applications to Persistence
We develop a stability theory for minimal projective resolutions of $\mathbf{P}$-modules, where $\mathbf{P}$ is a finite metric poset. We use the Gülen--McCleary distance on $\mathbf{P}$-modules together with a new complex matching distance on bounded complexes of finitely generated projective $\mat
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
- Complex Matching Distance and Stability for Minimal Projective Resolutions, with Applications to Persistence#798776
- Resolutions of linear $p$-cyclic quotient singularities#975237
- Finite-Sample Rigidity for Left-Translated Similarity Orbits and Off-Diagonal Quadratic Realizations#973547
- Near-uniform $q$-matroids#1142138
- Proximity Gaps for Gabidulin Codes and Applications#996656
Record · ID 797362
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