forcing · not in domain-math.js · 3 records · all concepts
runs2 · +1 retired
114For a hierarchical lattice whose rule is a Boolean function f on k independent children, the RG map is R(p) = Σ_j c_j p^j (1 − p)^{k−j} with c_j the number of accepted inputs of weight j, 0 ≤ c_j ≤ C(k, j).run
117On the exclusive hierarchical rules of run 114 (not-all-equal and the band rules [a, b], k = 2 … 12), does the distance to period three O(R) increase with k along NAE, and is the stretch |λ| at the interior fixed point above 1.8 on every rule that has a period-3 orbit?run
115On the twenty happy-family sporadic groups, do the three kinds of substructure they stabilise — V (a piece of the Leech lattice or Golay code), R (a ring or coordinate structure on the Leech lattice), F (the fixed points of an element or small subgroup of the Monster on V♮) — nest as R ⊂ V ⊂ F, group for group?run
generated 2026-10-25nothing on this page is maintained by hand