Observer / CONCEPT
A Rank-Three Protocol Beyond Balanced Deletion
A Boolean rank-three task admits three messages per side while all four whole-class deletions remain unbalanced.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH2
DOCUMENT LINKS1
A finite counterexample to deletion necessity
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
- An Actual Boolean K4 Subdivision and Its Exact Certificatestructural-affinity · Closed
- Binary Simple Graph Cycle Spacesstructural-affinity · Closed
- Boolean Tasks and the Complete Rank-Three Odd Fiberstructural-affinity · Closed
- Edge Connectivity and Binary Gradient Decodingstructural-affinity · Closed
- Edge Connectivity and Binary Gradient Weightstructural-affinity · Closed
- Exact Boolean Budgets at Low Cycle Rankstructural-affinity · Closed
- Finite Graph Probability Liftsstructural-affinity · Closed
- Graph rank states and cyclic embedding countsstructural-affinity · Closed
- ModuleCat Homology of a Binary Graph Cycle Spacestructural-affinity · Closed
- Uniform signed graph coefficient estimatestructural-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