Words / CONCEPT
Greatest cuts and finite descent enumeration
Greatest proper cuts give a literal weighted equivalence and exact finite descent recurrences.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
The weighted equivalence and exact recurrences
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 Capped Explorationstructural-affinity · Closed
- Actual Endpoint History Kernelstructural-affinity · Closed
- Actual fixed-cut factorizationstructural-affinity · Closed
- Actual minimum split and cardinal recurrencestructural-affinity · Closed
- Actual Minimum-Cut Kernelstructural-affinity · Closed
- Actual objects for the A398542 fixed-bottom conjecturestructural-affinity · Closed
- Archer-Bourne Decompositionstructural-affinity · Closed
- Classical avoidance and a proper cutstructural-affinity · Closed
- No Largest Derangement Limit Below Onestructural-affinity · Closed
- The A398542 fixed-bottom polynomial theoremstructural-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