Commit Graph

3 Commits

Author SHA1 Message Date
didericis c987259c14 dual_decomposition: iterated-reduction algorithm + Kempe/chord-apex search
- Add section 3 with Algorithm 3.1 (iterated reduction with protected edges)
  and remarks on invariants and chord-apex applicability.
- Add fig:iterated-reduction-trace illustrating the algorithm on G' =
  dodecahedron (G' -> H_1 -> H_2 -> terminate).
- experiments/iterated_reduction.py: Sage implementation of the algorithm.
- experiments/draw_iterated_reduction.py: produces the 3 trace figures.
- experiments/check_dodecahedron_kempe.py: enumerate proper 3-edge-colorings
  of the dodecahedron's reduced dual and check the chord-apex + Kempe-cycle
  conditions (0 of 36 colorings satisfy all three).
- experiments/search_kempe_property.py: search across min-deg-5
  triangulations; the n = 14 first plantri triangulation is the smallest hit
  (reduced dual has 20 v, 30 e).

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-23 12:40:38 -04:00
didericis 409dea565a dual_decomposition: chord-apex proof + diagrams
- Replace the chord-apex TODO with a full proof by contradiction: assume
  merged != spike, define X, Y, Z, W, lift to G' so that the externals
  inherit \psi(f) = (X, Y, Z, W, W), and split on W in {X, Z}. Either case
  meets the hypothesis of lem:pentagonal-externals, which extends \psi to a
  proper 3-edge-colouring of G' --- contradicting non-3-edge-colourability
  via Tait.
- Add fig:chord-apex-proof: the assumed reduced-dual colouring on top, and
  the two lifted-G' cases (W=Z, W=X) below, rendered on the dodecahedron.
- Add experiments/draw_chord_apex_proof.py.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-23 02:31:54 -04:00
didericis 1791b68f4a dual_decomposition: reduced-dual definition, verification, and step figures
Add Definition 2.1 (reduced dual) and a remark on cubicity/planarity, plus an
experiment verifying it on the icosahedron/dodecahedron and four figures, one
per construction step.

reduced_dual.py builds G' = dodecahedron (dual of the icosahedron), applies the
construction, and confirms the result is a cubic, planar, simple graph whose
dual is a simple triangulation. Finding: the construction is an n -> n-2
reduction (12 -> 10 here), not n-1, since the single apex v_n collapses one more
vertex than a standard pentagon re-triangulation; the result also re-introduces
degree-3 and degree-4 vertices (degree seq [7,5,5,5,5,5,5,4,4,3]).

draw_reduced_dual_steps.py renders fig_reduced_dual_step1..4.png, embedded as a
2x2 grid after the definition.

Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
2026-05-22 18:50:38 -04:00