1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.NT2026
A Lean formalisation of the disproof of Ramaekers's conjecture
Jeremy Tan
We describe Redhill, a Lean formalisation of the major results in Hölzl, Kleine and Stephan's "Improved Lower Bounds for Strong -Conjectures" (arXiv:2409.13439). Design decision…
math.CA2024
A blueprint for the formalization of Carleson's theorem on convergence of Fourier series
Lars Becker, María Inés de Frutos-Fernández, Leo Diedering +14
This paper is the blueprint underlying the Lean formalization of the proof of Carleson's classical result asserting almost everywhere convergence of Fourier series of continuous fu…
math.CO2022★ 1 cited
An attack on Zarankiewicz's problem through SAT solving
Jeremy Tan
The Zarankiewicz function gives, for a chosen matrix and minor size, the maximum number of ones in a binary matrix not containing an all-one minor. Tables of this function for smal…