didericis 6f0d036e44 Restate conjecture with "bridge-derived"; update empirical table and n=21 ...

- Conjecture now reads "bridge-derived level graph ... an intertwining tree,
  or both" -- the stronger form the evidence actually supports (a bridge-
  derived level graph is automatically a valid derived level graph).
- Empirical table recomputed for bridge-derivability, exhaustively for n<=9
  (every backward bridge-orbit fully enumerable there):
    n=7: 1 inter-only; n=8: 2 inter-only; n=9: 14 inter-only; missing=0.
  Added prose: below n=21 every class is intertwining, so the table shows
  how far the bridge-derived disjunct reaches on its own (36/50 at n=9) and
  that the two disjuncts complement each other; "bridge only" is 0 in range.
- n=21 subsection notes the four witnesses are explicit, short (path lengths
  3,1,2,4), archived, and step-verified.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>

2026-05-22 11:05:04 -04:00

538 KiB

Raw History

View Raw