Delphi.science

Flows and shortest paths in plane graphs, with machine programs including the maximum-flow algorithm of Borradaile, Klein, Mozes, Nussbaum and Wulff-Nilsen, in Lean 4

Source: github.com/RBarish-UTokyo/PlanarMaxFlow-WordRAM-Lean4/tree/…

Robert D. Barish

Palomar Registrypalomar/PALOMAR-2026-11-20-000001Nov 20, 2026math.COscore 0

A Lean 4 and Mathlib formalization of maximum flows and shortest paths. Plane graphs are combinatorial maps (darts with a reversal, a tail vertex, a face and a next dart along the face boundary) whose graph and dual are connected and which satisfy Euler's formula V + F = D/2 + 2. The machine statements are about one explicit word RAM (unit cost per instruction, natural registers and memory cells bounded by a word bound W along the run) and fixed encodings of the inputs as lists of natural numbers; each asserts one fixed program for all inputs. Six theorems are compared: (1) the max-flow…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-20-000001
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000001/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000001/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'