Combinatorics / CONCEPT
The Two Native Disconnected Counts
For every natural r at least one, each native disconnected-choice count is 4*(2^(r-1)-1).
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH10
DOCUMENT LINKS0
The even all-r formula
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
- Absolute Successor Wordsstructural-affinity · Closed
- Actual Active Support of Zigzag Choicesstructural-affinity · Closed
- Actual Realization and Root Activitystructural-affinity · Closed
- Feldman's Balance-Only Conjecture 9.3structural-affinity · Closed
- Odd Balanced-Choice Correspondencestructural-affinity · Closed
- Recovering Words from Actual Separationstructural-affinity · Closed
- The Actual Disconnection Criterionstructural-affinity · Closed
- The Second Labelled Sectorstructural-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