Analytic / CONCEPT
Finite Prony Node Identification
A full finite recurrence window identifies every separated Prony node carrying nonzero weight.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
A finite recurrence window identifies the true spectral roots
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Cauchy-Feature Right Inversestructural-affinity · Closed
- Chebyshev Endpoint Certificatestructural-affinity · Closed
- Finite Prony Annihilator Uniquenessstructural-affinity · Closed
- Finite Prony Generating Functionstructural-affinity · Closed
- Finite Prony Matrix Pencilstructural-affinity · Closed
- Finite Prony Shifted Hankel Transportstructural-affinity · Closed
- Finite Prony-Hankel Reconstructionstructural-affinity · Closed
- Noisy Moment Phase Boundarystructural-affinity · Closed
- Sparse Endpoint Tail Modulusstructural-affinity · Closed
- Two-Moment Support Holestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance