Code to reproduce the numerical results and figures of the paper "Fast Hamiltonian engineering from cut polytope geometry".
-
Updated
Sep 30, 2026 - Python
Code to reproduce the numerical results and figures of the paper "Fast Hamiltonian engineering from cut polytope geometry".
Lean 4 proof of the higher-dimensional Erdős distinct-distances bound (Erdos distinct distances): n points in R^d, d ≥ 3, determine at least c_d n^(2/d) distinct distances, and this order is sharp; formalization with Mathlib
This project features a Manim-based animation of a combinatorial geometry problem, created as a hands-on exercise to learn the MANIM library.
Edge-disjoint non-crossing triangle packings of planar point sets: a convex barrier and a reduction to subcubic trees
Extremal lattice rigidity from the No-Three-In-Line problem: symmetry, fundamental domains, and Sidon structures.
Lean 4 formalization of Sierksma's conjecture for nine points in R^3 (d = 3, r = 3)
First independent byte-exact reproduction of the Zinoviev-Ericson (1999) K(13) = 1154 kissing configuration in R^13, with full optimization pipeline, 13 paper-grade structural findings on dim-13 saturation, rare-paths doctrine, and dual Constructor/Auditor methodology with both-hats discipline.
Deterministic combinatorial framework for post-quantum cryptographic trapdoors based on multidimensional discrete torus invariants.
Computer-assisted proof that s(k^2-5)=k for every k>=7 — the k×k grid is optimal. Paper, exact certificate, and re-runnable checkers.
To associate your repository with the combinatorial-geometry topic, visit your repo's landing page and select "manage topics."