Words / CONCEPT
ExactDeckCore
Exact fixed-length decks recover every shorter scattered count.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES5
PROOF DEPTH6
DOCUMENT LINKS0
scatteredCount_eq_count_sublistsLen
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
- A Counterexample Inside Vivion's Restricted Classstructural-affinity · Closed
- Actual stopping, zero replay, and exact tailsstructural-affinity · Closed
- AlternatingTwoDeletionCountsstructural-affinity · Closed
- AriCoproductFiltrationstructural-affinity · Closed
- AriProjectionstructural-affinity · Closed
- AriWordOperationsstructural-affinity · Closed
- AriWordProductstructural-affinity · Closed
- BinaryRunSupersequenceCountsstructural-affinity · Closed
- CutoffCoefficientAlgebrastructural-affinity · Closed
- Entropy maximisers need not have balanced degreesstructural-affinity · Closed
- ExactDeckLowerBoundstructural-affinity · Closed
- Finite Deletion-Channel Entropy Orderingstructural-affinity · Closed
- FullFamilyHomogeneitystructural-affinity · Closed
- MagnusWordCoefficientsstructural-affinity · Closed
- Natural Valuations Cannot Preserve Every Abelian Complexity Functionstructural-affinity · Closed
- PositivePairBallGrowthstructural-affinity · Closed
- PositivePairExactDeckAsymptoticsstructural-affinity · Closed
- PositivePairFiltrationstructural-affinity · Closed
- PositivePairLeadingCoefficientsstructural-affinity · Closed
- TwoDeletionChannelEntropystructural-affinity · Closed
- Words: Morse Hedlund Conversestructural-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