Reframe the constraint floor honestly as a conjecture

Browse Source

Section 4 no longer states the floor as a proven Proposition. Now: prove
interior-free disks attain 2^(n-2) (ear-peeling) and the un-stacking
lemma, state |Phi(D)| >= 2^(n-2) as a Conjecture, and give an honest
status remark -- holds for the Apollonian class, reduces to the
irreducible case, empirically strict (5/4), but |Phi| is NOT monotone
(the earlier freedom-positive monotonicity claim was wrong) and both
natural elementary proofs provably fail. Soften the note's observation to
match.

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

...

This commit is contained in:

didericis

2026-06-17 21:32:57 -04:00

parent c482bc5633

commit 163e453464

7 changed files with 104 additions and 99 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

papers/heawood_restrictions_on_nested_tire_graph_duals/paper.pdf

BIN

Binary file not shown.