BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250312T120000
DTEND;TZID=America/New_York:20250312T130000
DTSTAMP:20260428T023947
CREATED:20241125T204953Z
LAST-MODIFIED:20250306T144354Z
UID:10003628-1741780800-1741784400@cmsa.fas.harvard.edu
SUMMARY:CMSA Q&A Seminar: Dan Freed
DESCRIPTION:CMSA Q&A Seminar \nSpeaker: Dan Freed\, Harvard University \nTopic: What are spectra (in homotopy theory)?
URL:https://cmsa.fas.harvard.edu/event/cmsaqa_31225/
LOCATION:Common Room\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:CMSA Q&A Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Q-A-Seminar-3.12.2025.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250312T140000
DTEND;TZID=America/New_York:20250312T150000
DTSTAMP:20260428T023947
CREATED:20250123T195100Z
LAST-MODIFIED:20250327T194539Z
UID:10003665-1741788000-1741791600@cmsa.fas.harvard.edu
SUMMARY:Discovery in Mathematics with Automated Conjecturing
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Randy Davila\, RelationalAI and Rice University \nTitle: Discovery in Mathematics with Automated Conjecturing \nAbstract: Automated conjecturing is a form of artificial intelligence that applies heuristic-driven methods to mathematical discovery. Since the late 1980s\, systems such as Fajtlowicz’s Graffiti\, DeLaViña’s Graffiti.pc\, and TxGraffiti have collectively contributed to over 130 publications in mathematical journals. In this talk\, we outline the evolution of automated conjecturing\, focusing on TxGraffiti\, a program that employs linear optimization methods and several distinct heuristics to generate mathematically meaningful conjectures. We will then introduce GraphMind\, a dueling framework where the Optimist proposes conjectures while the Pessimist seeks counterexamples\, fostering a feedback loop that strengthens automated reasoning. Finally\, we will present GraffitiAI\, a Python package that extends automated conjecturing across various mathematical domains. \nBio: Randy R. Davila is a Lecturer in the Department of Computational Applied Mathematics & Operations Research at Rice University and a Library Engineer at RelationalAI\, specializing in relational knowledge graph systems for intelligent data management. He earned his PhD in Mathematics from the University of Johannesburg in 2019\, with research focused on graph theory and combinatorial optimization. His work explores artificial intelligence in mathematical conjecture generation\, graph theory\, and neural network applications to combinatorial problems. As the creator of TxGraffiti\, he has developed AI-driven systems that have contributed to numerous mathematical publications. His recent projects include GraphMind\, a dueling agent-based framework that pairs conjecture generation with counterexample discovery\, and GraffitiAI\, a Python package for automated conjecturing across mathematical disciplines. \n 
URL:https://cmsa.fas.harvard.edu/event/newtech_31225/
LOCATION:Hybrid – G10
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-NTM-Seminar-3.12.2025.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250312T150000
DTEND;TZID=America/New_York:20250312T170000
DTSTAMP:20260428T023947
CREATED:20250210T183743Z
LAST-MODIFIED:20250307T175626Z
UID:10003711-1741791600-1741798800@cmsa.fas.harvard.edu
SUMMARY:Freedman CMSA Seminar: Michael Freedman (CMSA) & Elia Portnoy (MIT)
DESCRIPTION:Freedman CMSA Seminar \nSpeaker: Michael Freedman\, Harvard CMSA (3:00–4:00 pm ET) \nTitle: How many links can you fit in a box? \nAbstract: I’ll discuss a “made up” problem on the interface of topology and packing\, which may well be classified as “recreational math”.  Here is the first question suppose you have a unit box\, how many unlinked (split) copies of the Hopf link (c_1\,i\,c_2\,i) and be embedded so that for each copy the two components c_1\,i and c_2\,i maintain a distance of at least  some fixed \epsilon >0. Is this number even finite? \n  \nSpeaker: Elia Portnoy\, MIT (4:00–5:00 pm ET) \nTitle: An explicit packing of links in a box and some progress in quantitative embeddings \nAbstract: Following Freedman’s talk\, I’ll begin by showing how to pack a large number of links in a box with certain geometric and topological constraints (joint with Fedya Manin). If time permits\, I’ll also discuss some progress and open questions for the following quantitative embedding problem: given a simplicial complex X\, what is the smallest size of a map from X to R^n so that the preimage of each unit ball intersects a small constant number of simplices? \n 
URL:https://cmsa.fas.harvard.edu/event/freedman_31225/
LOCATION:Hybrid – G10
CATEGORIES:Freedman Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Freedman-Seminar-3.12.25.docx-1.png
END:VEVENT
END:VCALENDAR