scientific article; zbMATH DE number 7649964

DOI10.4230/LIPIcs.ITP.2019.15MaRDI QIDQ5875423

Johannes Hölzl, Sander R. Dahmen, Robert Y. Lewis

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1907.01449

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatoricsformal proofcap set problemlean

Mathematics Subject Classification ID

Related Items

What is the point of computers? A question for pure mathematicians, Formalising the Kruskal-Katona theorem in Lean

Uses Software

• kepler98
• Archive Formal Proofs

Cites Work

• Unnamed Item
• Homotopy type theory in Lean
• The HOL Light theory of Euclidean space
• Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
• A corrected quantitative version of the Morse lemma
• Type classes for mathematics in type theory
• Formalization and Execution of Linear Algebra: From Theorems to Algorithms
• A FORMAL PROOF OF THE KEPLER CONJECTURE