Files
math-research/papers
didericis bd8499a25b Isolate the irreducible case: reduces the floor proof to one lemma
irreducible_floor.py: over 10k+ irreducible disks (k>=1, min interior
degree >=4), |Phi| never violates 2^(n-2) and never sits on it -- min is
5*2^(n-4) = (5/4)2^(n-2), the wheel being the minimizer. Universal toggles
are dead (99.9% have zero boundary-only faces). Since un-stacking degree-3
vertices preserves Phi and terminates at a k=0 or irreducible residue, the
whole lower bound reduces to: every irreducible disk has |Phi| >= 2^(n-2).

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 20:08:00 -04:00
..