Observer / CONCEPT
Unifilar word affinity and pair survival
The affinity of words whose two unifilar trajectories have not merged equals a killed pair matrix row sum at every length.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH5
DOCUMENT LINKS0
sum words
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
- Actual marked cylinders and predictive endpoint massesstructural-affinity · Closed
- Bhattacharyya Affinity and the Bretagnolle--Huber Boundstructural-affinity · Closed
- Chernoff Information Zero Criterionstructural-affinity · Closed
- Divergence Bounds for Finite Two-Point Testing Errorstructural-affinity · Closed
- Finite PMF Likelihood Constructionstructural-affinity · Closed
- One distinguishing length and killed-pair contractionstructural-affinity · Closed
- Original cylinders at a future-output cutstructural-affinity · Closed
- Original stationary integer-time marked lawsstructural-affinity · Closed
- Positive stationary support and original cylindersstructural-affinity · Closed
- Sequential Hellinger Localization and Dichotomystructural-affinity · Closed
- Squared Hellinger Distance and Total Variationstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance