BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Seewoo Lee (EPFL)
DTSTART:20261013T180000Z
DTEND:20261013T190000Z
DTSTAMP:20261022T024543Z
UID:AI-CoNT/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AI-CoNT/6/">
 Some practical tips on digesting AI proofs: informal and formal aspects</a
 >\nby Seewoo Lee (EPFL) as part of AI\, Combinatorics and Number Theory Se
 minar\n\n\nAbstract\nIn this new era of proof abundance\, "digestion" has 
 become an important part of mathematics. As of October 2026\, LLM-generate
 d proofs are still hard to read\, and making them accessible requires cons
 iderable effort. On August 1\, OpenAI announced a result on the optimal ex
 ponent for both the Cohn–Elkies linear programming bound and the Bourgai
 n–Clozel–Kahane sign uncertainty principle. In this talk\, I will shar
 e my experience digesting this result. We will also go through its formali
 zation and how it can be improved.\n
LOCATION:https://researchseminars.org/talk/AI-CoNT/6/
END:VEVENT
END:VCALENDAR