Observer / CONCEPT
Exact Boolean Budgets at Low Cycle Rank
Connected partial Boolean tasks with cycle rank at most two have an exact uniform region of ordered message budgets.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH2
DOCUMENT LINKS1
Exact ordered budgets for cycle ranks zero, one and two
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
- A Rank-Three Protocol Beyond Balanced Deletionstructural-affinity · Closed
- 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
- 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
- Nikandish's subspace orthogonality clique numberstructural-affinity · Closed
- Nonradical lines preserve the full orthogonality graphstructural-affinity · Closed
- The fourteen-mode obstruction for parity Majorana codesstructural-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