Entropy / CONCEPT
The entropic Glibichuk–Konyagin conjecture
A zero atom and a uniform component refute the unconditional entropic sum-product assertion for every fixed k.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH6
DOCUMENT LINKS0
conv eq sum
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 finite counterexample to improved thermal recall convergencestructural-affinity · Closed
- Classical Markov monogamy for every permutationstructural-affinity · Closed
- Conditional Information Postprocessingstructural-affinity · Closed
- Entropy and Capacity under Carrier Forgettingstructural-affinity · Closed
- Equality Cases for Finite Shannon Entropystructural-affinity · Closed
- Equality in the Upper Mixture-Entropy Boundstructural-affinity · Closed
- Predictive Memory under Deterministic Refinementstructural-affinity · Closed
- The Finite Mixture Entropy Bracketstructural-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