Combinatorics / CONCEPT
Binary quotient separation and labelled two-run prefixes
Dyadic quotient separation constructs a compatible actual occurrence prefix at a two-run boundary.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES5
PROOF DEPTH0
DOCUMENT LINKS0
The dyadic rounding loss is controlled
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
- Binary selection with actual depleted supporttruth-dependency · Closed
- Exact packets for the two remaining ladderstruth-dependency · Closed
- Native common-cut two-negative joint lifttruth-dependency · Closed
- Source facts for the equal-outer marked joint lifttruth-dependency · Closed
- Three-bit circle sources at half-modulus capacitytruth-dependency · Closed
RELATED KNOWLEDGE
Structural connections
- A common zero cut for equal outer gapsstructural-affinity · Closed
- Binary selection with actual depleted supportstructural-affinity · Closed
- Exact packets for the two remaining laddersstructural-affinity · Closed
- Native common-cut two-negative joint liftstructural-affinity · Closed
- Source facts for the equal-outer marked joint liftstructural-affinity · Closed
- Source-forced residual windowsstructural-affinity · Closed
- The Q=2 empty-ladder boundarystructural-affinity · Closed
- Three-bit circle sources at half-modulus capacitystructural-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