Id: palomar/PALOMAR-2026-11-20-000015 Url: https://github.com/RBarish-UTokyo/Kasteleyn-Pfaffian-WordRAM-Lean4/tree/e7e967074349944cf909a772218b5fda5c274485 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-20-000015-v1.json Repo: https://github.com/RBarish-UTokyo/Kasteleyn-Pfaffian-WordRAM-Lean4 Tags: math.CO, cs.DS, msc:05C70, msc:05C10, msc:05C85, msc:15A15, msc:68Q25 Score: 0 Title: Kasteleyn orientations and the Pfaffian method for plane graphs, with a linear-time orientation, in Lean 4 Trust: high Domain: math.CO Source: palomar Authors: Robert D. Barish Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-20 Formalized: true Formalizes: title=Dimer statistics and phase transitions identifier= relationship=formalizes Formalizes: title=Graph theory and crystal physics identifier= relationship=formalizes Formalizes: title=Matching Theory identifier= relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-20-000015 A Lean 4 and Mathlib formalization of Kasteleyn's method for counting perfect matchings of plane graphs. Graphs are Mathlib simple graphs on a finite vertex type (no loops, no multiple edges); a rotation system is a permutation of the darts that cycles the darts leaving each vertex, its faces are the cycles of the face permutation, and it is plane if the graph is connected and Euler's formula V + F = E + 2 holds. A Kasteleyn orientation with respect to a face f0 is an orientation of the edges in which every face other than f0 has an odd number of clockwise darts. Since faces are cycles of…