didericis d87b94d3b3 face_monochromatic_pairs: partial structural proof of Conjecture (Deciding face)
Adds Definition (flank face) + 3 lemmas + a partial theorem proving
Conjecture (Deciding face) -- hence Conjecture 5.1 -- for the case
where at least one neighbour of v in the parent triangulation G has
degree ≤ 6:

  - Lemma (Flank-length formula): |F_{i, i+1}^♭| = n_i - 1.
  - Lemma (Flank covering, n_i = 5): boundary of F_{i, i+1}^♭ is in
    V(K_b) ∪ V(K_c). Proof: the single intermediate P is adjacent to
    both A_i and A_{i+1}; A_{i+1} ∈ V(K_b) ∩ V(K_c) via spike, so
    A_{i+1}'s c_0-edge (in K_b) or c_1-edge (in K_c) lands on P.
  - Lemma (Flank covering, n_i = 6): two intermediates P_1, P_2; P_2
    handled as the n_i = 5 case; P_1 covered by case analysis on
    φ(A_i P_1) ∈ {c, c_1}: in Case (a) K_b walks A_i → P_1 directly;
    in Case (b) propagation from P_2 via P_2's c-edge to P_1 (forced
    by properness at P_1 ruling out φ(P_1 P_2) = c_1).
  - Theorem (Partial proof of Conjecture (Deciding face)): combining
    the length formula and the covering lemmas, F_{i, i+1}^♭ is a
    deciding face whenever n_i ∈ {5, 6}, since its length is then 4
    or 5 (≢ 0 mod 3).

The remaining structural case is n_i ≥ 7 for all i (= all five
neighbours of v in G have degree ≥ 7); for these the merged-side
face F^♭_{i+3, i+4} of length n_{i+3} - 2 often plays the deciding
role empirically, but a uniform structural argument is left open.

Paper grows from 18 to 20 pages.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-25 04:29:47 -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%