ConceptDynamics / CONCEPT
Ranked permutation factors as actual graph relabelings
Ranked permutation factors as actual graph relabelings.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH10
DOCUMENT LINKS0
ranked_coordinate
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 finite graph words give chronological rectangular RS paths and exact scalar-extended endpoint mapsstructural-affinity · Closed
- Actual kernel towers and exact endpoint coordinatesstructural-affinity · Closed
- Actual relabel row matrices equal the reduced forward gyrationstructural-affinity · Closed
- Actual-history charts, endpoint-corrected positive-word gyration and signed time translationstructural-affinity · Closed
- Parallel-edge discrepancy on the original primitive path basisstructural-affinity · Closed
- The rectangular localized cochain equals the same actual positive-word gyration modulo threestructural-affinity · Closed
- Transport both relabel factors through the actual chartsstructural-affinity · Closed
- Transport forward orbit phases under timed history equivalencesstructural-affinity · Closed
- Unit-factor recodings retain the original parallel-edge rankstructural-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