2 citations · 5 across the 3 of their papers we have counts for
3 papers
Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma
Chelsea Edmonds, Lawrence C. Paulson
Formalised libraries of combinatorial mathematics have rapidly expanded over the last five years, but few use one of the most important tools: probability. How can often intuitive…
Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics
Chelsea Edmonds, Lawrence C. Paulson
The formalisation of mathematics is continuing rapidly, however combinatorics continues to present challenges to formalisation efforts, such as its reliance on techniques from a wi…
Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
Chelsea Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence C. Paulson
We have formalised Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions, two major results in extremal graph theory and additive combinatorics, using the proo…