Formalisation of the Cambridge Part II and Part III courses Graph Theory, Combinatorics, Extremal and Probabilistic Combinatorics in Lean
-
Updated
Aug 19, 2025 - Lean
#
additive-combinatorics
Here are 8 public repositories matching this topic...
Formalisation of the Kelley-Meka bound on Roth numbers
-
Updated
Aug 19, 2025 - Lean
The (currently unofficial) sublibrary of Mathlib dedicated to additive combinatorics
-
Updated
Aug 19, 2025 - Shell
Formalisation in the Lean theorem prover of the relation between corner-free sets and communication complexity
-
Updated
Aug 19, 2025 - TeX
Miscellaneous projects I am working on in Lean
-
Updated
Aug 19, 2025 - Lean
AddComb.js is a javascript library for additive combinatorics calculation.
-
Updated
Apr 29, 2025 - HTML
Preprint + minimal, reproducible code/data for the Structure–Randomness Transfer Theorem (SRTT); headless runner, HTML report, CI, Pages.
compressed-sensing streaming-algorithms nonuniform-sampling anomaly-detection random-matrix-theory sparse-recovery anomaly-detection-algorithm harmonic-analysis additive-combinatorics pseudorandomness structure-vs-randomness gowers-norms
-
Updated
Sep 22, 2025 - Python
Explicit constructions of large 3-zero-sum-free subsets in (Z/4Z)^n. Baseline size 176, refined 512 for n=5. Code and data for additive combinatorics.
-
Updated
Aug 29, 2025 - Python
Improve this page
Add a description, image, and links to the additive-combinatorics topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the additive-combinatorics topic, visit your repo's landing page and select "manage topics."