• From ICON to GenICON: In-Context Operator Learning with Uncertainty Quantification (Siting Liu, UCR)

    Emmy Noether Room, Estella 1021, Pomona College, 610 N. College Ave., Claremont, CA, United States

    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 […]

  • Coordinate ring of the universal centralizer via Demazure operators (Tom Gannon, UCR)

    Estella 2099

    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 […]

  • CCMS Colloquium: Andrew Fiss (Michigan Technological University)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    CCMS Colloquium invites you to a talk by Andrew Fiss (Michigan Technological University) Title: “Singing American Math: College Traditions from Book Burnings to Observatory Parties, 1880s-1920s" Abstract:  “Singing Math” is a practice […]

  • An Exact Algorithm for the Unanimous Vote Problem (Feyza Duman Keles, NYU)

    Emmy Noether Room, Estella 1021, Pomona College, 610 N. College Ave., Claremont, CA, United States

    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 […]

  • Voting on relations using pairs information (Michael Orrison, HMC)

    Estella 2099

    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 […]

  • Number Theory Learning Seminar (Organizational Meeting)

    NT Learning Seminar
    Burkle 24, Claremont Graduate University 1021 N. Dartmouth Ave., Claremont, United States

    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. The 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 […]

  • GEMS September 5th Session

    Shanahan 3481, Harvey Mudd College 320 E. Foothill Blvd., Claremont, CA, United States

    This GEMS session will be facilitated by Professor Qidi Peng and William Wu from Claremont Graduate University. Title: How to create a die if you only have a coin? Abstract: 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 […]

  • Field extensions built from dynamical systems, ramification, and Julia sets (Michelle Manes, American Institute of Mathematics)

    Estella 1021 (Emmy Noether Room), Pomona College Claremont, CA, United States

    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 , ramification, and associated Galois representations) are surprisingly different in the cases that $K$ is a number field versus a […]

  • Fall 2026 Research Poster Session

    The Drucker Institute 1021 N. Dartmouth Ave., Claremont, CA, United States

    This poster session is meant to showcase undergraduate and graduate work in the mathematical sciences, broadly interpreted, in a supportive environment. The poster session will take place at Claremont Graduate […]

  • NT Learning Seminar — Newman’s Proof of the PNT (Maxwell Kooiker)

    NT Learning Seminar
    Burkle 12, Claremont Graduate University 1021 N. Dartmouth Ave., Claremont, United States

    We showcase Newman's proof of the Prime Number Theorem, published by Don Zagier. Link: https://www.jstor.org/stable/2975232 For questions about the event, please contact your NTLS Organizers: Maxwell Kooiker (Maxwell.Kooiker@cgu.edu) or Prof. Edray Goins (Edray.Goins@pomona.edu)

  • Adaptive Experimental Design using Shrinkage Estimators (Evan Rosenman, Claremont McKenna College)

    Emmy Noether Room, Estella 1021, Pomona College, 610 N. College Ave., Claremont, CA, United States

    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. We […]