didericis
f868de4f67
NEW Theorem 1.15: The tire treads from a single-vertex level
source S = {v_0} form a rooted tree T(G, S) under face containment.
Statement:
- Root: the depth-0 tire tread T_0 with degenerate outer
boundary {v_0} (the apex tire, B_out = {v_0}).
- Parent: for any tire tread T_c at depth d ≥ 1, the unique
parent T_p at depth d-1 is the tire whose inner outerplanar
graph O^(p) has B_out^(c) as one of its bounded faces.
Equivalently, R_c lies inside this bounded face of O^(p).
- Children: bijection with bounded faces of O^(p) whose
interior contains depth-≥(d+2) vertices.
Proof structure:
1. Root well-defined: G'_0 is connected (fan around v_0), so
unique component → unique T_0.
2. Existence of parent: faces immediately outside B_out^(c) on
the S-side have depth d-1, lie in some component of G'_{d-1}.
3. Uniqueness: by Proposition 1.7 (source-side simple-cycle
property), B_out^(c) is a simple cycle, and the depth-(d-1)
faces around it form a single contiguous arc in the dual,
hence one component → unique parent.
4. Children description: bounded faces of O^(p) are in bijection
with deeper component-tires.
5. Tree property: parent map strictly decreases depth, hence
no cycles, hence rooted tree.
Plus two clarifying remarks:
- Remark 1.16: multiple children iff O^(p) has multiple bounded
faces with non-trivial interiors. Spoke-only case → exactly
one child.
- Remark 1.17: combined with Theorem 1.9 (partition) and
Theorem 1.12 (outerplanar inner dual), any coloring problem
on G factors through:
• local outerplanar coloring on each tread,
• parent-child consistency along shared B_out^(c) cycles.
This is the structural setup for the chain-pigeonhole program.
Page count: 10 → 11.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
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 directorysystem_name— optional label for this machine (defaults tohostname -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