Learning Short Proofs for Counting Planar Lattice Triangulations

Explore the intersection of artificial intelligence and pure mathematics in this conference talk by Carlos Simpson from Université de Nice. Delve into the fascinating topic of learning shorter proofs for counting planar lattice triangulations. Gain insights into how AI techniques can be applied to streamline mathematical proofs, specifically in the context of combinatorial geometry. Discover the potential of machine learning to enhance problem-solving in mathematics and contribute to more efficient proof-finding methods. Join this hour-long session to understand the innovative approaches being developed at the forefront of AI and mathematical research.

Carlos Simpson, Université de Nice: Learning Short Proofs for Counting Planar Lattice Triangulations