Certificates / CONCEPT
Entropy maximisers need not have balanced degrees
An unbalanced three-edge multigraph maximises orientation-count entropy.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES4
PROOF DEPTH0
DOCUMENT LINKS0
Orientations as a product of finite sets
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
RELATED KNOWLEDGE
Structural connections
- A counterexample to the Shannon branch-and-bound lower boundstructural-affinity · Closed
- Circular hypergraphs do not maximise orientation-count entropystructural-affinity · Closed
- ExactDeckCorestructural-affinity · Closed
- Finite Deletion-Channel Entropy Orderingstructural-affinity · Closed
- TwoDeletionChannelEntropystructural-affinity · Closed
- TwoDeletionRunDecksstructural-affinity · Closed
- TwoDeletionRunEntropyBoundsstructural-affinity · Closed
- Word Counts and Coefficient 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