BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260427T161500
DTEND;TZID=America/Los_Angeles:20260427T171500
DTSTAMP:20260427T135401
CREATED:20260424T155240Z
LAST-MODIFIED:20260424T155341Z
UID:4091-1777306500-1777310100@colleges.claremont.edu
SUMMARY:From ICON to GenICON: In-Context Operator Learning with Uncertainty Quantification (Siting Liu\, UCR)
DESCRIPTION:Abstract: I will introduce In-Context Operator Networks (ICON)\, a framework in which a single neural network learns solution operators for differential equations directly from a few prompted input-output examples at inference time\, without any weight updates. ICON acts as a few-shot learner across forward and inverse problems for ODEs\, PDEs\, and mean-field control. I will then present a probabilistic interpretation: under a random differential equation data model\, ICON implicitly computes the posterior predictive mean given the context\, linking operator learning to Bayesian inference. This motivates GenICON\, a generative variant that samples from the posterior predictive for principled uncertainty quantification\, yielding a unified Bayesian view of in-context operator learning.
URL:https://colleges.claremont.edu/ccms/event/from-icon-to-genicon-in-context-operator-learning-with-uncertainty-quantification-siting-liu-ucr/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Ryan Aschoff":MAILTO:ryan.aschoff@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260428T121500
DTEND;TZID=America/Los_Angeles:20260428T131000
DTSTAMP:20260427T135401
CREATED:20260123T011543Z
LAST-MODIFIED:20260422T205356Z
UID:3970-1777378500-1777381800@colleges.claremont.edu
SUMMARY:Coordinate ring of the universal centralizer via Demazure operators (Tom Gannon\, UCR)
DESCRIPTION:One of the key objects used in Ngo’s proof of the fundamental lemma is the group scheme of universal centralizers associated to a split reductive group G. In this talk\, we’ll discuss forthcoming work\, joint with Victor Ginzburg\, which describes the coordinate ring of the group scheme of universal centralizers in terms of the root datum of G using Demazure (or divided difference) operators. We will then discuss how our result follows from a more general computation on Weil restriction and\, time permitting\, we will discuss a potential generalization of our result to Coulomb branches.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-tom-gannon-ucr/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260501T110000
DTEND;TZID=America/Los_Angeles:20260501T121500
DTSTAMP:20260427T135401
CREATED:20260110T235319Z
LAST-MODIFIED:20260422T180840Z
UID:3958-1777633200-1777637700@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Andrew Fiss (Michigan Technological University)
DESCRIPTION:CCMS Colloquium invites you to a talk by Andrew Fiss (Michigan Technological University)\n\n \nTitle: “Singing American Math: College Traditions from Book Burnings to Observatory Parties\, 1880s-1920s”\n \nAbstract:  “Singing Math” is a practice that linked American colleges of the late nineteenth and early twentieth centuries. A part of broader college singing traditions\, it stood apart because of its subject matter: mathematical sciences. Noting how math songs were sung outdoors\, in theaters\, and in observatories\, this talk explores stories of textbook burials at Yale and Ohio Wesleyan; theatrical productions at MIT\, Purdue\, and the Michigan College of Mines; and observatory parties at Vassar Observatory\, Lick Observatory\, and Harvard Observatory. Overall\, it argues that math songs are a form of technical communication\, one that enjoyed large reach because of its multiple meanings and varied practices.\n \nBio: Andrew Fiss is associate professor of technical communication at Michigan Technological University. With an undergraduate degree in mathematics from Vassar College and graduate degrees in history and philosophy of science from Indiana University\, he works in history of math\, technical communication\, and STS\, and his book Performing Math: A History of Communication and Anxiety in the American Mathematics Classroom (2021) won the 2023 Best Book Award in Technical or Scientific Communication from the Conference on College Composition & Communication. \n 
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-8/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260501T161500
DTEND;TZID=America/Los_Angeles:20260501T171500
DTSTAMP:20260427T135401
CREATED:20260426T200817Z
LAST-MODIFIED:20260426T200817Z
UID:4094-1777652100-1777655700@colleges.claremont.edu
SUMMARY:An Exact Algorithm for the Unanimous Vote Problem (Feyza Duman Keles\, NYU)
DESCRIPTION:Abstract: Consider n independent\, biased coins\, each with a known probability of heads. Presented with an ordering of these coins\, flip (i.e.\, toss) each coin once\, in that order\, until we have observed both a head and a tail\, or flipped all coins. The Unanimous Vote problem asks us to find the ordering that minimizes the expected number of flips. Gkenosis et al. [arXiv:1806.10660] gave a polynomial-time approximation algorithm for this problem\, where the approximation ratio is the golden ratio. They left open whether the problem was NP-hard. We answer this question by giving an exact algorithm that runs in time O(n log n). The Unanimous Vote problem is an instance of the more general Stochastic Boolean Function Evaluation problem: it thus becomes one of the only such problems known to be solvable in polynomial time. Our proof uses simple interchange arguments to show that the optimal ordering must be close to the ordering produced by a natural greedy algorithm. Beyond our main result\, we compare the optimal ordering with the best adaptive strategy\, proving a tight adaptivity gap of 1.2 + o(1) for the Unanimous Vote problem.
URL:https://colleges.claremont.edu/ccms/event/an-exact-algorithm-for-the-unanimous-vote-problem-feyza-duman-keles-nyu/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Analysis Seminar
ORGANIZER;CN="Ryan Aschoff":MAILTO:ryan.aschoff@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260505T121500
DTEND;TZID=America/Los_Angeles:20260505T131000
DTSTAMP:20260427T135401
CREATED:20260119T224840Z
LAST-MODIFIED:20260427T163251Z
UID:3962-1777983300-1777986600@colleges.claremont.edu
SUMMARY:Voting on relations using pairs information (Michael Orrison\, HMC)
DESCRIPTION:Many aggregation problems ask us to turn individual judgments into a single collective outcome. In this talk\, we model each voter’s input as a relation on a set of alternatives\, allowing pairwise comparisons to include strict preferences\, ties\, or incomparability. This perspective gives a common framework for median procedures and scoring methods\, including several familiar voting rules. The distance-based side leads naturally to graphs such as the hypercube of relations\, while the scoring-based side leads to questions about linear operators on functions on relations. At the center is a natural four-parameter family of scoring matrices whose eigenspace decompositions separate meaningful types of pairwise information\, connecting voting theory with graph theory\, linear algebra\, and harmonic analysis. \nThis is joint work with Karl-Dieter Crisman\, Erin McNicholas\, and Kathryn Nyman.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-michael-orrison-hmc/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260908T121500
DTEND;TZID=America/Los_Angeles:20260908T131000
DTSTAMP:20260427T135401
CREATED:20260417T223051Z
LAST-MODIFIED:20260417T223051Z
UID:4081-1788869700-1788873000@colleges.claremont.edu
SUMMARY:ANTC talk -- Michelle Manes (American Institute of Mathematics)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/antc-talk-michelle-manes-american-institute-of-mathematics/
LOCATION:TBA
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR