didericis 83df771199 coloring_nested_tire_graphs: add note explaining 2-SAT solvability
Standalone explanation of what "2-SAT solvability" means in the
context of the rainbow proof (rainbow_proof.tex, Conjecture 1.5):

- Defines 2-SAT in general (boolean variables, 2-variable clauses,
  P-time decidable).
- Maps it onto our rainbow proof: variables = orientation bits o_j
  at D-positions; clauses = inter-D-position gap constraints; cyclic
  chain wraps around T'_ann.
- "Solvable" ⇔ proper edge 3-coloring with given σ exists, i.e.
  σ ∈ π_D.
- Cyclic 2-SAT can in principle fail; toy example (3-cycle of
  not-equal clauses = odd-cycle 2-coloring obstruction).
- Empirically our system never fails for σ ∈ P_m (6-18 satisfying
  orientations per σ at m=6), but a structural proof is open.
- Why it matters: proving Conjecture 1.5 upgrades the rainbow
  proof's provisional corollary into a theorem and reduces chain
  pigeonhole to the perms-per-half overlap.

Note: two_sat_solvability.tex (3 pages).

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-26 11:12:16 -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%