A sharp lower bound for adjacent-edge correlations in random subtrees
Scott Schubr, Luminary Oddities. 18 October 2026.

Archive edition 2:
https://research.luminaryoddities.com/sharp-lower-bound-adjacent-edge-correlations-random-subtrees/v/2

main.pdf is the reference manuscript; main.tex contains the editable source
and bibliography. Compile main.tex twice with pdfLaTeX and the packages
declared in its preamble.

To reproduce the finite exact checks, extract this package into a writable
directory and run Python 3 without -O or -OO:
    python verification/independent_check.py
The script uses standard-library exact rational arithmetic and assertions.
It writes independent_results.json beside itself. The finite checks support
the analytic argument; the manuscript supplies the proof for every n >= 3.

manifest.json and SHA256SUMS authenticate the supplied files. Rebuilt PDFs
may differ in compiler metadata. No new licence or public reuse permission
is granted by this source package.
