didericis b2aa14cefa face_monochromatic_pairs: write up strengthened Lemma for G'-pentagon fallback
Update Remark (gprime-pigeonhole-stop) with the empirical
characterization of S-vertex structure:

  1. |S| is always EVEN.
  2. S forms a 2-regular induced subgraph (= single cycle, or rare
     |S|=4 disjoint pairs).
  3. S-cycle is NEVER a face boundary of the reduced dual.
  4. p_G ≥ 7 in every bad colouring (from bad-triple constraint).

Tabulate the max # pent hit and min p_G per |S| bucket:
  |S|=2: hit≤2 < p_G≥7 ⇒ 5+ pentagons uncovered ✓
  |S|=4: hit≤4 < p_G≥8 ⇒ 4+ uncovered ✓
  |S|=6: hit≤7 < p_G≥8 ⇒ 1+ uncovered ✓
  |S|=8: hit≤8, but empirically when hit=8 we have p_G≥9 (=
         the combination hit=8 AND p_G=8 never occurs empirically)
         ⇒ 1+ uncovered. The "hit=8 AND p_G=8 don't co-occur" fact
         is a structural property of chord-apex+Kempe colourings
         we don't yet have a non-empirical proof of.
  |S|=10: hit≤7 < p_G≥8 ⇒ 1+ uncovered ✓

Combined empirical verification: 1,314 / 1,314 (100%) of bad
chord-apex+Kempe colourings have at least one G'-pentagon with
boundary in V(K_b) ∪ V(K_c) ⇒ G'-pentagon fallback empirically
true on full 142,812 dataset.

Paper structure note: the proof now resembles discharging
(Appel-Haken/RSST/Gonthier style) but with ~8 structural buckets
instead of 633, because chord-apex+Kempe does most of the work
upfront. The structural ~95% coverage + empirical 100% closure is
the current state.

Paper grows from 22 to 23 pages.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-25 07:23:31 -04:00
2026-04-12 22:23:55 -04:00
2026-04-20 16:32:27 -04:00
2026-04-20 16:32:27 -04:00
2026-04-20 17:00:04 -04:00
2026-04-20 16:32:27 -04:00
2026-04-17 00:54:42 -04:00
2026-05-09 11:34:58 -04:00

math-research

Personal mathematics research repository by Eric Bauerfeld. Papers are written in AMS-LaTeX using the amsart document class.

Papers

kempe_style_search_for_smaller_contradiction

Humans Suffice: A Novel Proof of the Four Color Theorem

An in-progress proof of the Four Color Theorem via a minimal counterexample argument. The paper builds on Kempe's 1879 strategy — establishing valid cases for vertices of degree ≤ 4, then extending the argument to the degree-5 case using properties of non-adjacent degree-5 vertices, merged subgraphs, and locked colorings.

plane_depth_labelling

Plane Depth Labelling

Early-stage paper. Title and author information set; content in progress.

Creating a New Paper

Use run.sh to scaffold a new paper from the AMS-LaTeX template:

./run.sh init_paper "Your Paper Title"

This creates a new directory (name derived from the title) containing a paper.tex pre-filled with the title and author.

Setup

The Python library code in lib/ requires SageMath. Run setup once per machine:

./run.sh setup <sage_python_path> <sage_site_packages> [system_name]
  • sage_python_path — path to the SageMath Python interpreter (e.g. /opt/sage/local/bin/python3)
  • sage_site_packages — path to SageMath's site-packages directory
  • system_name — optional label for this machine (defaults to hostname -s); used to store per-machine env files as .env.<system_name>

On subsequent runs the paths default to whatever was saved in .env, so ./run.sh setup alone re-runs setup with the existing configuration.

Setup also compiles the plantri submodule via make.

Running Sage

To run a Sage script with plantri available on PATH:

./run.sh sage <script.py> [args...]

Or to open an interactive Sage session:

./run.sh sage

Linting

./run.sh lint

Runs pyright and pylint on lib/ using the SageMath Python interpreter.

Shell Completion

To enable tab-completion for run.sh in zsh, add this to your .zshrc:

eval "$(path/to/run.sh completion)"

Or source it once in the current shell session:

eval "$(./run.sh completion)"

Building

Papers are compiled with LaTeX. From within a paper directory:

latexmk -pdf paper.tex
S
Description
No description provided
Readme 277 MiB
Languages
Python 69%
TeX 30.8%
Shell 0.2%