didericis 6413560a7b coloring_nested_tire_graphs: conjecture sketch on universal nesting
NEW Conjecture 1.19 (universal nesting of tire-tread trees,
sketch):

For any two rooted trees of tire treads T_1 = T(G_1, S_1) and
T_2 = T(G_2, S_2), T_1 NESTS into T_2:

Choose any tire T in T_2 and any non-trivial bounded face f of
its inner outerplanar graph O^(T). Then there exists a maximal
planar graph G̃ with level source S̃ such that:
  (N1) T(G̃, S̃) contains T_2 as a sub-tree.
  (N2) The sub-tree rooted at the new child of T at face f is
       isomorphic to T_1.

Informally: any tree of tire treads can be inserted into any
non-trivial face slot of any other tree of tire treads. The
class of trees of tire treads is closed under composition by
face-slot insertion.

Followed by Remark 1.20 motivating the conjecture:

- Compositional colourability: if 4-colourability of G̃ follows
  from 4-colourability of G_1, G_2 via parent-child consistency
  (Remark 1.18 / former tree-coloring-factorisation), then 4CT
  propagates through nesting. A min 4CT counterexample would have
  to be irreducible under such nesting.

- Universality: trees of tire treads become a "term algebra" for
  decomposing plane triangulations; coloring arguments can be
  inductive on this algebra.

Open subquestions in remark:
  - Precise notion of "isomorphic as rooted trees of tire treads"
    (combinatorial vs geometric vs up to embedding).
  - Constructive description of G̃ from G_1, G_2, f.
  - Compatibility with Birkhoff's internally 6-connected condition.

Page count: 12 → ~13.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-27 03:32:44 -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%