BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211013T140000
DTEND;TZID=America/New_York:20211013T150000
DTSTAMP:20240515T204354Z
CREATED:20240214T093531Z
LAST-MODIFIED:20240515T204354Z
UID:10002637-1634133600-1634137200@cmsa.fas.harvard.edu
SUMMARY:Computer-Aided Mathematics and Satisfiability
DESCRIPTION:Speaker: Marijn Heule\, Carnegie Mellon University \nTitle: Computer-Aided Mathematics and Satisfiability \nAbstract: Progress in satisfiability (SAT) solving has made it possible to determine the correctness of complex systems and answer long-standing open questions in mathematics. The SAT solving approach is completely automatic and can produce clever though potentially gigantic proofs. We can have confidence in the correctness of the answers because highly trustworthy systems can validate the underlying proofs regardless of their size. We demonstrate the effectiveness of the SAT approach by presenting some recent successes\, including the solution of the Boolean Pythagorean Triples problem\, computing the fifth Schur number\, and resolving the remaining case of Keller’s conjecture. Moreover\, we constructed and validated a proof for each of these results. The second part of the talk focuses on notorious math challenges for which automated reasoning may well be suitable. In particular\, we discuss our progress on applying SAT solving techniques to the chromatic number of the plane (Hadwiger-Nelson problem)\, optimal schemes for matrix multiplication\, and the Collatz conjecture.
URL:https://cmsa.fas.harvard.edu/event/10-13-2021-new-technologies-in-mathematics-seminar/
LOCATION:MA
CATEGORIES:New Technologies in Mathematics Seminar
END:VEVENT
END:VCALENDAR