Research
The mathematics of the mrly tree: a parity rule on a cube, substituted into itself. These pages are the near-final findings. Every claim is tagged Proved, Verified, or Conjecture, every sequence was regenerated by two independent generators before it shipped, and every page survived an adversarial verification pass. The scripts, b-files, and run logs live in the lab.
Pages
- core — what a design is, and the headline counts.
- bijection — designs are Boolean functions up to cube
symmetry; the count is A000616. The strongest theorem.
- pi — pi recovered from the density of coprime points in the
stacked set.
- primes — the stack's moire is a Farey resonance diagram;
each scale n adds exactly phi(n) bright nodes.
- coprime — the coprimality spine: exact base-local
factors on every design, and the census behind them.
- euler — Euler characteristics of the parity solids: two
closed forms, and a disproof corrected in public.
- bases — what base 3 hides: an Eisenstein-lattice constant
inside base-3 arithmetic.
- cuts — the six-gasket theorem: a diagonal cut through one
parity solid is Sierpinski all the way down.
- slices — the diagonal slice of the solid cube: the 6n
census, centered-hexagonal vertices, and the splitting-prime rule.
- connectivity — self-similar designs raced against
matched random cell sets on components and boundary.
- dimensions — complex dimensions: every design in
the lattice class, and where Minkowski measurability fails.
- complexity — Boolean complexity of the catalog, and
the Laplacian spectra of the walk graphs.
- evidence — the skeptic-facing summary of what is
actually checked, weaker results included.
- sequences — the ledger: every sequence this project
has produced, with terms, formulas, and verification status.
- method — how the results here are produced and checked,
worked through on the odd-side fill polynomial.