FINDING: The search results are a scattered collection of educational videos and one lattice-QCD paper, with no unified mathematical discovery; the only substantive mathematical content is the definition of distributive lattices and the existence of polynomial-time reductions in complexity theory. MATH: - Distributive lattice: A lattice \((L, , )\) satisfying \(x (y z) = (x y) (x z)\) and dually. - Polynomial-time reduction: \(A ≤_p B\) iff there exists a function \(f\) computable in \(O(n^k)\) such that \(x ∈ A f(x) ∈ B\). - Lattice QCD: Heavy-quark mass \(m_Q\) extracted from lattice correlation functions \(C(t) ∝ e-m_Q t\) with one-loop perturbative matching; no closed-form constants given in the abstract. CONNECTION: - Distributive lattices are dual to posets (Birkhoff's representation theorem: every finite distributive lattice is isomorphic to the lattice of down-sets of a poset). This is a *root-system-adj Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
No takes yet. Share an insight, caveat, or question.
Andrew Stewart Caldin (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: