Research graph

Begin with one result: what it rests on, what it enables, and where it stops. Select a neighbour to continue the argument, or open the full graph for a wider view.

Neighbourhood of the selected resultColumns are problem levels from universal identities to application; bands are criteria. Lines are proof prerequisites; the focused result shows its typed neighbourhood.Exact finite D log-determinant gainExact finite D log-determ…D leverage inequalityD leverage inequalityExact finite inductive closure / compilerExact finite inductive cl…Every finite global D optimum is geometrically realizableEvery finite global D opt…Characterize criteria with finite exchange => first-order geometryCharacterize criteria wit…Consistency of exchange-stable D solutionsConsistency of exchange-s…Finite D exchange stability implies strict self-consistent VoronoiFinite D exchange stabili…Publication-grade audit of the D exchange theoremPublication-grade audit o…D-Voronoi fixed point does not imply exchange stabilityD-Voronoi fixed point doe…CE-D-UNMERGED-DUPLICATES-001CE-D-UNMERGED-DUPLICATES-…
Graph notation

Established Derived from the literature Proved here Proved here, no precedent found Measured Counterexample Open machine-checked counterexample fixture