Combinatorics / CONCEPT
Labelled Retirement Path Data
A finite two-sector path type retains every form label, charge, and parity-specific boundary needed for the literal count.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH1
DOCUMENT LINKS1
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
- Encoding Paths as Zigzag Choicesstructural-affinity · Closed
- Even Balanced-Choice Correspondencestructural-affinity · Closed
- Finite Laurent Coefficient Formulastructural-affinity · Closed
- Frontier Retirement and Boundary Flowstructural-affinity · Closed
- Literal Zigzag Choices and Balancestructural-affinity · Closed
- Local Classification of Labelled Choicesstructural-affinity · Closed
- Odd Balanced-Choice Correspondencestructural-affinity · Closed
- Recovering Balance and Labelsstructural-affinity · Closed
- Weighted Labelled Pathsstructural-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