8 Commits

Author SHA1 Message Date
didericis 163e453464 Reframe the constraint floor honestly as a conjecture
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>
2026-06-17 21:32:57 -04:00
didericis 1d981b4d01 Add the freedom-positive counting balance to the constraint floor
Remark: a disk with k interior vertices has 2k+n-2 faces (Euler) but only
k interior constraints, so each interior vertex adds two degrees of
freedom against one constraint -- depth is freedom-positive and Phi can
only retain or enlarge below the interior-free floor 2^(n-2). Motivates
the lower bound and replaces the prior TODO sketch.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 02:24:04 -04:00
didericis d2156f06ee Scaffold the 2^(n-2) constraint-floor proposition
Add section 4: define the achievable boundary set Phi(D) of a triangulated
disk and state the constraint-floor proposition |Phi(D)| >= 2^(n-2), with
the attainment direction proved (fan injectivity) and the lower bound left
as a marked gap with strategy. Remark records the zonotope structure and
the short-interface concentration of difficulty.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 02:14:52 -04:00
didericis 351ae0cdfe Account for the outer face in the Heawood face-sum identity
The bounded-face sum omits the outer face at outer-boundary vertices, so
restrict the gluing identity to interior vertices (where all cluster
interfaces live) and recover a colouring by carrying a single +/-1 label
on the unbounded face f_inf, giving Heawood's identity on the full cubic
dual for the Tait step.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 01:33:07 -04:00
didericis c5f81842c7 Run Heawood pigeonhole between nested connected tire clusters
Add the two-sided cluster decomposition proposition: a vertex's full
Heawood face-sum splits as exactly one child-cluster contribution plus
one parent-cluster contribution (the at-most-two-clusters bound makes the
pairing binary and complete). Explain why this fails per-tire -- a vertex
on many same-depth tires has only a fragment of its face-star in any one
tire -- and recast the chain-pigeonhole and 4CT conjectures to nested
clusters with a cluster restriction relation.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 01:10:30 -04:00
didericis 646cf9d12f Add connected tire clusters with two-cluster-per-vertex proposition
Define a connected tire cluster (union of same-depth tires joined by
shared vertices, transitive closure), prove same-depth tires meet only
in vertices, and prove every vertex lies in at most two clusters (one at
each of two consecutive depths) -- the bounded coarsening of the
unbounded per-vertex tire count.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 01:03:37 -04:00
didericis 251c453437 Add Heawood chain-pigeonhole programme to tire-dual paper
Define a +/-1 Heawood face-labelling of a tire, its induced boundary
Heawood sequences and restriction relation, and interface compatibility
(0<->0, +1<->-1 = vertex face-sum vanishes mod 3). State the Heawood
chain-pigeonhole conjecture and a tire route to the Four Colour Theorem,
parallel to the medial programme.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 00:45:03 -04:00
didericis 851ca7fbed Scaffold Heawood restrictions on nested tire graph duals paper
Add a new paper stub referencing the nested tire decompositions paper,
with intro, Heawood bibliography entry, and an empty restrictions section.

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