ConceptDynamics / CONCEPT
Counted group chain recovery windows
One finite matrix chain constructs one equivariant homeomorphism carrying both edge windows and both group-coordinate windows. The transfer is read from that same code.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
Construct one code with four recovery budgets
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Actual integer-cut rays and intrinsic finite beamsstructural-affinity · Closed
- Actual ordered factor paths and reversible peelingstructural-affinity · Closed
- Complete arbitrary-table criterionstructural-affinity · Closed
- Coordinates for actual fixed blocksstructural-affinity · Closed
- Counted group-labelled overlap codesstructural-affinity · Closed
- Original18.3: fixed block rigiditystructural-affinity · Closed
- Prescribed finite arrays and ordered labelsstructural-affinity · Closed
- The involution factorization as an exact exchangestructural-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