YoVDO

Learning Short Proofs for Counting Planar Lattice Triangulations

Offered By: IMSA via YouTube

Tags

Mathematics Courses Combinatorial Geometry Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

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


Taught by

IMSA

Related Courses

Theory Seminar - Face Numbers, Isabella Novik
Paul G. Allen School via YouTube
Category Weight Estimates of Minimal Triangulations
Applied Algebraic Topology Network via YouTube
Isabella Novik - Face Numbers - The Upper Bound Side of the Story
International Mathematical Union via YouTube
The Geometry of Geometries - Matroid Theory, Old and New
International Mathematical Union via YouTube
Stanford Lecture - Don Knuth - "A Conjecture That Had To Be True"
Stanford University via YouTube