StatisticalMechanics / CONCEPT
A finite counterexample to improved thermal recall convergence
Removing intermediate memory resets increases the permutation approximation error in a finite reduced protocol.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH6
DOCUMENT LINKS0
A four-level counterexample
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
- Classical Markov monogamy for every permutationstructural-affinity · Closed
- Conditioning Reduces Entropystructural-affinity · Closed
- Equality in the Upper Mixture-Entropy Boundstructural-affinity · Closed
- Sharp coupling budgets on a permutation cyclestructural-affinity · Closed
- Strong Subadditivity and Conditional Productsstructural-affinity · Closed
- The 2-swap greedy shortest-path conjecture is falsestructural-affinity · Closed
- The entropic Glibichuk–Konyagin conjecturestructural-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