BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.17.3.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:20261021T161500
DTEND;TZID=America/Los_Angeles:20261021T171500
DTSTAMP:20260903T023147Z
CREATED:20260903T023110Z
LAST-MODIFIED:20260903T023147Z
UID:10002243-1792599300-1792602900@colleges.claremont.edu
SUMMARY:Fall Break Event — Graduate/Academic Panel (On Zoom)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/fall-break-event-graduate-academic-panel-on-zoom/
LOCATION:On Zoom
CATEGORIES:Colloquium,Special Event
ORGANIZER;CN="Qidi Peng":MAILTO:Qidi.Peng@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20261014T161500
DTEND;TZID=America/Los_Angeles:20261014T171500
DTSTAMP:20260903T022741Z
CREATED:20260903T022741Z
LAST-MODIFIED:20260903T022741Z
UID:10002241-1791994500-1791998100@colleges.claremont.edu
SUMMARY:CCMS Colloquium — Austyn Simpson (Bates College)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-austyn-simpson-bates-college/
LOCATION:Burkle 16\, Claremont Graduate University\, 1021 N. Dartmouth Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Qidi Peng":MAILTO:Qidi.Peng@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20261007T161500
DTEND;TZID=America/Los_Angeles:20261007T171500
DTSTAMP:20260903T024236Z
CREATED:20260903T022417Z
LAST-MODIFIED:20260903T024236Z
UID:10002240-1791389700-1791393300@colleges.claremont.edu
SUMMARY:CCMS Colloquium — Sixian Jin (CSU San Marcos)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-sixian-jin-csu-san-marcos/
LOCATION:Burkle 16\, Claremont Graduate University\, 1021 N. Dartmouth Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Qidi Peng":MAILTO:Qidi.Peng@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20261006T121500
DTEND;TZID=America/Los_Angeles:20261006T131000
DTSTAMP:20260903T162807Z
CREATED:20260903T162807Z
LAST-MODIFIED:20260903T162807Z
UID:10002249-1791288900-1791292200@colleges.claremont.edu
SUMMARY:Permutation Jones Polynomials (Sam Nelson\, CMC)
DESCRIPTION:The Jones Polynomial is an important invariant of knots with applications in physics\, quantum computation and more. In this talk I will introduce a family of generalizations of the Jones polynomial associated to permutations of finite sets and discuss their properties.
URL:https://colleges.claremont.edu/ccms/event/permutation-jones-polynomials-sam-nelson-cmc/
LOCATION:Estella 1021 (Emmy Noether Room)\, Pomona College\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20261005T161500
DTEND;TZID=America/Los_Angeles:20261005T171500
DTSTAMP:20260910T053858Z
CREATED:20260910T053858Z
LAST-MODIFIED:20260910T053858Z
UID:10002255-1791216900-1791220500@colleges.claremont.edu
SUMMARY:If a Statistical Model Predicts That Common Events Should Occur Only Once in 10\,000 Elections\, Maybe it’s the Wrong Model (Danny Ebanks\, Cal Tech)
DESCRIPTION:Political scientists forecast elections\, not primarily to satisfy public interest\, but to validate statistical models used for estimating quantities of scholarly interest. Although scholars have learned a great deal from these models\, they can be embarrassingly overconfident: Events that should occur once in 10\,000 elections occur almost every year\, and even those that should occur once in a five-quadrillion elections are sometimes observed. We develop the first generative statistical model of all US federal legislative elections for the U.S. House (1946–2024) and Senate (1954–2024) and validate it with extensive out-of-sample tests. We find that even as the incumbency advantage rises and falls\, voting patterns nationalize\, and heresthetic maneuvering remake candidacies and campaigns\, the fundamental quantities of interest related to American legislative elections remain constant over eighty years\, including but not limited to the probability of incumbent defeat\, the magnitude and dispersion of candidate effects\, the midterm penalty\, and the partisan bias of electoral maps. Most striking\, we show that the same set of structural parameters describes both U.S. House and Senate elections\, implying a universal data-generation process for American legislative elections in the postwar era.
URL:https://colleges.claremont.edu/ccms/event/if-a-statistical-model-predicts-that-common-events-should-occur-only-once-in-10000-elections-maybe-its-the-wrong-model-danny-ebanks-cal-tech/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Ami Radunskaya":MAILTO:aradunskaya@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260930T161500
DTEND;TZID=America/Los_Angeles:20260930T171500
DTSTAMP:20260903T024139Z
CREATED:20260903T021345Z
LAST-MODIFIED:20260903T024139Z
UID:10002239-1790784900-1790788500@colleges.claremont.edu
SUMMARY:CCMS Colloquium — Christine Lee (Texas State University)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-christine-lee-texas-state-university/
LOCATION:Burkle 16\, Claremont Graduate University\, 1021 N. Dartmouth Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Qidi Peng":MAILTO:Qidi.Peng@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260929T121500
DTEND;TZID=America/Los_Angeles:20260929T131000
DTSTAMP:20260903T022824Z
CREATED:20260903T022824Z
LAST-MODIFIED:20260903T022824Z
UID:10002242-1790684100-1790687400@colleges.claremont.edu
SUMMARY:ANTC talk (Omid Khormali\, HMC)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/antc-talk-omid-khormali-hmc/
LOCATION:Estella 1021 (Emmy Noether Room)\, Pomona College\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260928T161500
DTEND;TZID=America/Los_Angeles:20260928T171500
DTSTAMP:20260913T232258Z
CREATED:20260913T232258Z
LAST-MODIFIED:20260913T232258Z
UID:10002330-1790612100-1790615700@colleges.claremont.edu
SUMMARY:Brain Imaging and Mathematical Modeling of Alzheimer's Disease (Peter Hinow\, U. Wisconsin\, Milwaukee)
DESCRIPTION:A wide variety of medical imaging methods exist for research and diagnostic procedures on the Central Nervous System (CNS)\, among them Magnetic Resonance Imaging (MRI) and Optical Imaging. Mathematical modeling and simulation contribute significantly to an improved understanding of image data and the intricate transport\, diffusion\, and metabolic processes in the brain. This is of particular importance in the study of pathologies such as Alzheimer’s Disease\, which\, 125 years after its description\, remains poorly understood and for which only moderate success has been made in its treatment. In the first work to be presented\, we investigate tracer diffusion and transport in the glymphatic system by combining optical imaging in rats with a partial differential equation of reaction-advection-diffusion type. In a second work\, we collect observations on the accumulation of amyloid-β\, changes in neuronal density\, and a decline in cognitive performance in TgF344-AD and wild-type rats. We develop a compartmental ordinary differential equation model and determine its parameters by fitting the output to the experimental observations. In the long run\, our mathematical modeling effort is intended to bridge AD research in rodent models and the human condition of AD. This is joint work with Dr. Muna Aryal (North Carolina Agricultural and Technical State University) and Micah Hesketh\, MS (graduate student\, UWM).
URL:https://colleges.claremont.edu/ccms/event/brain-imaging-and-mathematical-modeling-of-alzheimers-disease-peter-hinow-u-wisconsin-milwaukee-2/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Ami Radunskaya":MAILTO:aradunskaya@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260924T161500
DTEND;TZID=America/Los_Angeles:20260924T173000
DTSTAMP:20260911T200120Z
CREATED:20260911T191930Z
LAST-MODIFIED:20260911T200120Z
UID:10002260-1790266500-1790271000@colleges.claremont.edu
SUMMARY:NT Learning Seminar — Functions Which Represent Primes (Joy Shin)
DESCRIPTION:We showcase Functions Which Represent Prime Numbers. Presented by Joy Shin. Link: https://www.jstor.org/stable/2032078 \n\n\n\nFor questions about the event\, please contact your NTLS Organizers: \nMaxwell Kooiker (Maxwell.Kooiker@cgu.edu) or Prof. Edray Goins (Edray.Goins@pomona.edu)
URL:https://colleges.claremont.edu/ccms/event/ntls-3/
LOCATION:CA
CATEGORIES:Special Event
ORGANIZER;CN="Maxwell Kooiker":MAILTO:maxwell.kooiker@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260923T161500
DTEND;TZID=America/Los_Angeles:20260923T171500
DTSTAMP:20260913T210711Z
CREATED:20260913T210711Z
LAST-MODIFIED:20260913T210711Z
UID:10002323-1790180100-1790183700@colleges.claremont.edu
SUMMARY:The Stochastic Logistic Map: Theory and Applications — Kimberly Ayers (CSU San Marcos)
DESCRIPTION:Abstract: The logistic map is one of the most famous examples in dynamical systems. Originally introduced as a simple model of population growth\, it exhibits a surprisingly rich range of behavior: as a single parameter varies\, stable equilibria give way to periodic orbits and eventually to chaos. But in real populations\, quantities such as reproductive and death rates are unlikely to remain constant over time. What happens when we allow this parameter to vary randomly from one generation to the next? \nIn this talk\, we explore a stochastic version of the logistic map in which the parameter is chosen randomly at each iteration. Introducing randomness changes the questions we ask: rather than studying individual fixed points or periodic orbits\, we investigate probability distributions that describe the long-term behavior of the system. We will see how tools from dynamical systems and Markov processes can be used to show that\, under appropriate conditions\, the stochastic system settles into a unique long-term statistical behavior that is independent of its initial state. We conclude with simulations illustrating this invariant distribution and discuss several questions about how the system’s behavior changes as the amount and type of randomness vary. \n\n\n\nFor questions about the event\, please contact your CCMS Colloquium chairs: \nProf. Robert Cass (Robert.Cass@ClaremontMcKenna.edu) or Prof. Qidi Peng (Qidi.Peng@cgu.edu) \nFor logistical questions\, contact Maxwell Kooiker (Maxwell.Kooiker@cgu.edu)\, the CCMS Colloquium Assistant.
URL:https://colleges.claremont.edu/ccms/event/the-stochastic-logistic-map-theory-and-applications-kimberly-ayers-csu-san-marcos/
LOCATION:Burkle 16\, Claremont Graduate University\, 1021 N. Dartmouth Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Qidi Peng":MAILTO:Qidi.Peng@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260922T121500
DTEND;TZID=America/Los_Angeles:20260922T131000
DTSTAMP:20260830T220038Z
CREATED:20260830T220038Z
LAST-MODIFIED:20260830T220038Z
UID:10002234-1790079300-1790082600@colleges.claremont.edu
SUMMARY:ANTC talk (Lenny Fukshansky\, CMC)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/antc-talk-lenny-fukshansky-cmc-2/
LOCATION:Estella 1021 (Emmy Noether Room)\, Pomona College\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260921T161500
DTEND;TZID=America/Los_Angeles:20260921T171500
DTSTAMP:20260913T231319Z
CREATED:20260913T231319Z
LAST-MODIFIED:20260913T231319Z
UID:10002329-1790007300-1790010900@colleges.claremont.edu
SUMMARY:Number Theory meets Differential Equations: Using Homotopy Continuation to Compute Shabat Polynomials
DESCRIPTION:A Belyĭ pair \(\bigl( S\,\\, z(w) \bigr)\) is a compact\, connected Riemann surface \(S\) together with a rational function \(z \colon S \to \mathbb{P}^1(\mathbb{C})\) which has at most three critical values \(\bigl\{ 0\,\\, 1\,\\, \infty \bigr\}\). The preimage \(z^{-1}\bigl( [0\,1] \bigr) \subseteq S \hookrightarrow \mathbb{R}^3\) is a bipartite graph called a Dessin d’Enfant. When \(S = \mathbb{P}^1(\mathbb{C}) \simeq S^2(\mathbb{R})\) is the Riemann sphere\, a tree—namely\, a planar graph with one face—can be realized as the Dessin d’Enfant of a polynomial. Named in honor of Georgii Borisovich Shabat\, a Belyĭ map \(z \colon S \to \mathbb{P}^1(\mathbb{C})\) which is also a polynomial is called a Shabat polynomial. \nIn this project\, we seek to compute more examples of Shabat polynomials. We introduce a trick which reduces the computation of such polynomials to finding solutions to a system of polynomial equations. We explore computing these solutions via two methods: (1) Newton’s method\, to find approximate values\, and (2) the homotopy continuation method\, to deform known solutions into desired yet unknown ones. Simply put\, in this talk we give an introduction to using differential equations to answer questions in number theory. \nThis project was completed through the Research Experience for Undergraduate Faculty (REUF) at AIM/ICERM in Summers 2025 and 2026 (DMS‑2015462).
URL:https://colleges.claremont.edu/ccms/event/number-theory-meets-differential-equations-using-homotopy-continuation-to-compute-shabat-polynomials/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Ami Radunskaya":MAILTO:aradunskaya@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260917T161500
DTEND;TZID=America/Los_Angeles:20260917T173000
DTSTAMP:20260911T195823Z
CREATED:20260911T191628Z
LAST-MODIFIED:20260911T195823Z
UID:10002259-1789661700-1789666200@colleges.claremont.edu
SUMMARY:NT Learning Seminar — Diophantine Rep. of the Set ℙ (TBA)
DESCRIPTION:We showcase Diophantine Representation of the Set of Prime Numbers by Jones\, Sato\, Wada and Wiens. Link: https://www.jstor.org/stable/2318339 \n\n\n\nFor questions about the event\, please contact your NTLS Organizers: \nMaxwell Kooiker (Maxwell.Kooiker@cgu.edu) or Prof. Edray Goins (Edray.Goins@pomona.edu)
URL:https://colleges.claremont.edu/ccms/event/ntls-2/
LOCATION:CA
CATEGORIES:Special Event
ORGANIZER;CN="Maxwell Kooiker":MAILTO:maxwell.kooiker@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260916T161500
DTEND;TZID=America/Los_Angeles:20260916T171500
DTSTAMP:20260913T213353Z
CREATED:20260913T213353Z
LAST-MODIFIED:20260913T213353Z
UID:10002328-1789575300-1789578900@colleges.claremont.edu
SUMMARY:Edge Ideals via Independence Polynomials of Graphs — Dalena Vien (Bryn Mawr)
DESCRIPTION:Abstract: Edge ideals of graphs provide a fertile ground for uncovering combinatorial expressions for algebraic invariants of squarefree monomial ideals. Many algebraic invariants of these edge ideals directly reflect combinatorial properties of their underlying graphs. In this talk\, I will discuss how the independence polynomial \(P_G(x)\)\, the generating function for independent sets of a graph \(G\)\, encodes surprisingly rich information about the Hilbert series of the corresponding edge ideal \(I(G)\). In particular\, I will explain how \(P_G(x)\) determines both the top coefficient and degree of the \(h\)-polynomial. I will then demonstrate the results through familiar examples and a simple suspension construction that lets us track these invariants cleanly. \n\n\n\nFor questions about the event\, please contact your CCMS Colloquium chairs: \nProf. Robert Cass (Robert.Cass@ClaremontMcKenna.edu) or Prof. Qidi Peng (Qidi.Peng@cgu.edu) \nFor logistical questions\, contact Maxwell Kooiker (Maxwell.Kooiker@cgu.edu)\, the CCMS Colloquium Assistant.
URL:https://colleges.claremont.edu/ccms/event/edge-ideals-via-independence-polynomials-of-graphs-dalena-vien-bryn-mawr/
LOCATION:Burkle 16\, Claremont Graduate University\, 1021 N. Dartmouth Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Qidi Peng":MAILTO:Qidi.Peng@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260915T121500
DTEND;TZID=America/Los_Angeles:20260915T131000
DTSTAMP:20260907T173603Z
CREATED:20260830T212148Z
LAST-MODIFIED:20260907T173603Z
UID:10002233-1789474500-1789477800@colleges.claremont.edu
SUMMARY:Kloosterman sums and Bessel functions (Robert Cass\, CMC)
DESCRIPTION:Kloosterman sums are explicit exponential sums which occur in several contexts in number theory and arithmetic geometry. Bessel functions encode a great deal of representation-theoretic information about finite groups of Lie type\, but they are difficult to compute in general. In this talk\, we will carefully define these objects and describe a direct relationship between them. One of our main goals is to provide many explicit examples\, including ones for the exceptional groups E6 and E7.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-robert-cass-cmc-3/
LOCATION:Estella 1021 (Emmy Noether Room)\, Pomona College\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260914T161500
DTEND;TZID=America/Los_Angeles:20260914T171500
DTSTAMP:20260910T052954Z
CREATED:20260910T052954Z
LAST-MODIFIED:20260910T052954Z
UID:10002252-1789402500-1789406100@colleges.claremont.edu
SUMMARY:Adaptive Experimental Design using Shrinkage Estimators (Evan Rosenman\, Claremont McKenna College)
DESCRIPTION:In multi-armed trials\, adaptive designs are a popular way to increase estimation efficiency or identify optimal treatments. Many recent papers have proposed adaptive methods for minimizing the error of unbiased estimators that consider each treatment arm in isolation. This approach may be inefficient\, because it fails to borrow shared information across the treatment arms.\nWe consider adaptivity in a sequential trial with K active treatments and a control\, and suggest the use of Stein-like shrinkage estimators to obtain the final causal estimates. These estimators share information\, yielding reductions in expected estimation error\, relative to estimating each causal effect in isolation. Moreover\, for a group of candidate estimators\, the expected error can be expressed as the expectation of ratios of Gaussian quadratic forms\, and can thus be computed efficiently. Hence\, we suggest a simple algorithm for sequential adaptivity: assign each new arrival to the arm that will minimize the estimated shrinker loss.\nThrough simulations\, we demonstrate that this approach reduces estimation error\, especially in the low signal-to-noise regime. We also characterize how our adaptive algorithm assigns treatments differently than would a classical Neyman allocation and suggest a method for constructing shorter confidence intervals at the conclusion of the trial.
URL:https://colleges.claremont.edu/ccms/event/adaptive-experimental-design-using-shrinkage-estimators-evan-rosenman-claremont-mckenna-college/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Ami Radunskaya":MAILTO:aradunskaya@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260910T161500
DTEND;TZID=America/Los_Angeles:20260910T173000
DTSTAMP:20260911T015128Z
CREATED:20260911T014659Z
LAST-MODIFIED:20260911T015128Z
UID:10002257-1789056900-1789061400@colleges.claremont.edu
SUMMARY:NT Learning Seminar — Newman's Proof of the PNT (Maxwell Kooiker)
DESCRIPTION:We showcase Newman’s proof of the Prime Number Theorem\, published by Don Zagier. Link: https://www.jstor.org/stable/2975232 \n\n\n\nFor questions about the event\, please contact your NTLS Organizers: \nMaxwell Kooiker (Maxwell.Kooiker@cgu.edu) or Prof. Edray Goins (Edray.Goins@pomona.edu)
URL:https://colleges.claremont.edu/ccms/event/nt-learning-seminar-newmans-proof-of-the-pnt-maxwell-kooiker/
LOCATION:Burkle 12\, Claremont Graduate University\, 1021 N. Dartmouth Ave.\, Claremont\, 91711\, United States
CATEGORIES:Special Event
ORGANIZER;CN="Maxwell Kooiker":MAILTO:maxwell.kooiker@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260909T161500
DTEND;TZID=America/Los_Angeles:20260909T173000
DTSTAMP:20260903T024403Z
CREATED:20260902T221601Z
LAST-MODIFIED:20260903T024403Z
UID:10002238-1788970500-1788975000@colleges.claremont.edu
SUMMARY:Fall 2026 Research Poster Session
DESCRIPTION:This poster session is meant to showcase undergraduate and graduate work in the mathematical sciences\, broadly interpreted\, in a supportive environment. \nThe poster session will take place at Claremont Graduate University at The Drucker Institute\, 1021 N Dartmouth Ave from 4:15pm – 5:30pm\, on Wednesday September 9th\, 2026. \n  \nRefreshments will be provided! For any questions about the event\, please contact your CCMS Colloquium chairs: \nProf. Robert Cass (Robert.Cass@ClaremontMcKenna.edu) or Prof. Qidi Peng (Qidi.Peng@cgu.edu)
URL:https://colleges.claremont.edu/ccms/event/fall-2026-research-poster-session/
LOCATION:The Drucker Institute\, 1021 N. Dartmouth Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium,Special Event
ORGANIZER;CN="Qidi Peng":MAILTO:Qidi.Peng@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260908T121500
DTEND;TZID=America/Los_Angeles:20260908T131000
DTSTAMP:20260821T073419Z
CREATED:20260417T223051Z
LAST-MODIFIED:20260821T073419Z
UID:10001800-1788869700-1788873000@colleges.claremont.edu
SUMMARY:Field extensions built from dynamical systems\, ramification\, and Julia sets (Michelle Manes\, American Institute of Mathematics)
DESCRIPTION:Given a polynomial defined over a field $K$\, you can build an extension of $K_\infty / K$ by adjoining inverse images of some point $\alpha \in K$. The behavior of these extensions (including the degree [K_\infty : K]\, ramification\, and associated Galois representations) are surprisingly different in the cases that $K$ is a number field versus a local field. In this talk\, I’ll describe the development of these ideas over the past almost 20 years\, culminating in some ongoing work that pushes our understanding of the local field case even further and connects these ideas to the (Berkovich) Julia set for the polynomials.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-michelle-manes-american-institute-of-mathematics/
LOCATION:Estella 1021 (Emmy Noether Room)\, Pomona College\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260905T100000
DTEND;TZID=America/Los_Angeles:20260905T115500
DTSTAMP:20260829T044019Z
CREATED:20260813T212431Z
LAST-MODIFIED:20260829T044019Z
UID:10002217-1788602400-1788609300@colleges.claremont.edu
SUMMARY:GEMS September 5th Session
DESCRIPTION:This GEMS session will be facilitated by Professor Qidi Peng and William Wu from Claremont Graduate University.\n\n\nTitle: How to create a die if you only have a coin?\n\nAbstract: Imagine you have no dice but only coins\, how do you play a monopoly game? This lesson introduces a number of mysterious methods to simulate all probabilities only by flipping a coin. Throughout the session we will also show the beauty of randomness by introducing random number\, probability distribution\, simulator\, and practical algorithms for simulation.
URL:https://colleges.claremont.edu/ccms/event/gems-september-5th-session/
LOCATION:Shanahan 3481\, Harvey Mudd College\, 320 E. Foothill Blvd.\, Claremont\, CA\, 91711-3941\, United States
CATEGORIES:GEMS
ORGANIZER;CN="Teal Witter":MAILTO:raylen.witter@claremontmckenna.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260903T160000
DTEND;TZID=America/Los_Angeles:20260903T170000
DTSTAMP:20260827T235836Z
CREATED:20260827T215746Z
LAST-MODIFIED:20260827T235836Z
UID:10002232-1788451200-1788454800@colleges.claremont.edu
SUMMARY:Number Theory Learning Seminar (Organizational Meeting)
DESCRIPTION:An organizational meeting for this semester’s “Number Theory Learning Seminar will take place on Thursday September 3 at 4:00 PM in CGU’s Burkle Hall\, Room 24. \nThe Seminar is geared for graduate students\, undergraduates\, and faculty to learn about topics in number theory which are not typically covered in traditional classes. The volunteers will take turns presenting one preselected paper within the allocated 60 minutes. These papers are relatively short — averaging less than 10 pages in length — and cover some results known mainly to researchers in the field\, such as Newman’s proof of the Prime Number Theorem\, Bhargava’s proof of the 15 Theorem\, and Elkies’s counterexample to a conjecture of Euler. Prior knowledge of number theory is not required to understand the topics we will discuss. Seminar attendees are not required to participate in presentations\, but all are encouraged. \nThe regular weekly meeting time will be determined at the organizational meeting. For more information\, contact Maxwell Kooiker (maxwell.kooiker@cgu.edu) or Edray Goins (edray.goins@pomona.edu).
URL:https://colleges.claremont.edu/ccms/event/number-theory-learning-seminar-organizational-meeting/
LOCATION:Burkle 24\, Claremont Graduate University\, 1021 N. Dartmouth Ave.\, Claremont\, 91711\, United States
CATEGORIES:Special Event
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260519T113000
DTEND;TZID=America/Los_Angeles:20260519T123000
DTSTAMP:20260515T022232Z
CREATED:20260515T021837Z
LAST-MODIFIED:20260515T022232Z
UID:10002231-1779190200-1779193800@colleges.claremont.edu
SUMMARY:Unraveling Hidden Patterns with Topological Data Analysis (Dr. Elena Wang\, University of Fribourg\, Switzerland)
DESCRIPTION:Topology\, akin to geometry\, delves into the study of the shapes and structures of mathematical spaces\, ranging from simple surfaces to intricate collections of functions and objects. In recent years\, these foundational concepts have extended beyond pure mathematics to address practical problems in data science\, influencing diverse areas such as chemistry\, neuroscience\, and robotics. This talk aims to demystify the core techniques of Topological Data Analysis (TDA)\, such as persistent homology\, and illustrate their significance through applications in shape analysis\, machine learning\, and computational biology. We will explore how TDA provides unique insights into data structuring and analysis\, offering solutions to complex problems. \nPizza will be served.
URL:https://colleges.claremont.edu/ccms/event/unraveling-hidden-patterns-with-topological-data-analysis-dr-elena-wang-university-of-fribourg-switzerland/
LOCATION:Estella 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, United States
CATEGORIES:Topology Seminar
ORGANIZER;CN="Vin de Silva":MAILTO:vin.desilva@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260505T121500
DTEND;TZID=America/Los_Angeles:20260505T131000
DTSTAMP:20260427T163251Z
CREATED:20260119T224840Z
LAST-MODIFIED:20260427T163251Z
UID:10001792-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:20260501T161500
DTEND;TZID=America/Los_Angeles:20260501T171500
DTSTAMP:20260426T200817Z
CREATED:20260426T200817Z
LAST-MODIFIED:20260426T200817Z
UID:10002015-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:20260501T110000
DTEND;TZID=America/Los_Angeles:20260501T121500
DTSTAMP:20260422T180840Z
CREATED:20260110T235319Z
LAST-MODIFIED:20260422T180840Z
UID:10002083-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:20260428T121500
DTEND;TZID=America/Los_Angeles:20260428T131000
DTSTAMP:20260422T205356Z
CREATED:20260123T011543Z
LAST-MODIFIED:20260422T205356Z
UID:10001795-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:20260427T161500
DTEND;TZID=America/Los_Angeles:20260427T171500
DTSTAMP:20260424T155341Z
CREATED:20260424T155240Z
LAST-MODIFIED:20260424T155341Z
UID:10002014-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:20260424T110000
DTEND;TZID=America/Los_Angeles:20260424T121500
DTSTAMP:20260422T175653Z
CREATED:20260110T235232Z
LAST-MODIFIED:20260422T175653Z
UID:10001862-1777028400-1777032900@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Manuel Reyes (UCI)
DESCRIPTION:CCMS Colloquium invites you to a talk by Manuel Reyes (UCI)\n\n \nTitle: When XY is not equal to YX\n \nAbstract:  The commutative property of algebra states that the order of multiplication makes no difference: XY = YX. This property is so ingrained in our experience that it becomes difficult to imagine how algebra would function without it! If the commutative property fails\, we step into the territory of noncommutative algebra. Where and why does noncommutative algebra occur? How different is it from our ordinary commutative algebra? This talk will be an introduction to noncommutative algebra\, with several examples and a glimpse into current research problems.\n \nBio: Manny Reyes is an Associate Professor of Mathematics at UC Irvine. His research lies at the intersection of several topics including ring theory\, noncommutative geometry\, category theory\, and quantum foundations. After studying at Westmont College and UC Berkeley\, he was a postdoctoral fellow at UC San Diego and a faculty member for several years at Bowdoin College before returning to California. He strives to teach in a way that invites anyone to discover a passion for mathematics\, regardless of their past experiences. \n 
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-7/
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:20260421T121500
DTEND;TZID=America/Los_Angeles:20260421T131000
DTSTAMP:20260415T053435Z
CREATED:20260123T053557Z
LAST-MODIFIED:20260415T053435Z
UID:10001797-1776773700-1776777000@colleges.claremont.edu
SUMMARY:Diophantine avoidance\, primitive elements\, and normal basis theorem (Sehun Jeong\, CMC)
DESCRIPTION:Diophantine avoidance has been studied by several authors in recent years. This refers to effective results on existence of points of bounded size in a given algebraic set avoiding some specified subsets. The famous primitive element theorem states that every number field K is of the form Q(a) for some element a in K. From the proof of this theorem\, it is clear that not only there are infinitely many such primitive elements in K\, but in fact most elements in K are primitive. One natural question to ask is about finding a primitive element of small “size”\, where we use a height function to measure size. We discuss the conjecture of Ruppert and known results in this direction\, as well as our recent work on this problem. In addition\, we provide the standard and effective version of normal basis theorem\, obtaining an explicit bound in terms of the degree and discriminant of K\, where K/Q is a Galois extension. At the end\, we discuss a particularly good bound in the case of prime degree. This is joint work with Lenny Fukshansky.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sehun-jeong-cmc/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260420T161500
DTEND;TZID=America/Los_Angeles:20260420T171500
DTSTAMP:20260408T061621Z
CREATED:20260408T061621Z
LAST-MODIFIED:20260408T061621Z
UID:10002013-1776701700-1776705300@colleges.claremont.edu
SUMMARY:The Secret Life of Turbulent Fluids (Vincent Martinez\, Caltech)
DESCRIPTION:Abstract: Turbulence influences our lives in a multitude of ways\, ranging from the mundane (when we stir milk into our coffee) to the spectacular (the formation of galaxies). It is a great achievement of the human intellect that we are able to locate fundamental mechanisms shared by phenomenon with such a dramatic difference in scale and subsequently study them abstractly through mathematics. This talk will present some of the ways for how fluids and turbulent motion can be studied mathematically and introduce a few interesting problems\, both theoretical and practical\, of ongoing scientific relevance.
URL:https://colleges.claremont.edu/ccms/event/the-secret-life-of-turbulent-fluids-vincent-martinez-caltech/
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
END:VCALENDAR