A. I. Algebraic Geometry Algebra/Logic DeLong Diversity Functional Analysis Grad Algebra/Logic Homotopy Init Conditions Kempner Lie Theory Math Club Math Phys Noncomm Geometry Number Theory PDE/Analysis Probability Rep Theory Grad Student Seminar Thesis Defenses Topology Ulam Math Edu

Events for September 2026 – January 2027

Return to this week

Thu, Sep. 17 5pm (MATH 350)	Algebraic Geometry Jon Kim (University of Colorado Boulder) X The moduli space of cubic surfaces with a marked line lies naturally between the moduli space of fully marked and unmarked cubic surfaces and comes equipped with a W(D_5)-action corresponding to the stabilizer of the marked line. Hodge theoretic compactifications of these moduli spaces have been extensively studied by many, including Allcock—Carlson—Toledo, Dolgachev—van Geemen—Kondo, and Casalaina-Martin—Grushevsky—Hulek. In previous work, by using KSBA wall crossing, we described many different birational models of this moduli space via KSBA stable pairs. In this talk, we will discuss recent results regarding the W(D_5)-invariant birational geometry of these KSBA moduli spaces and ongoing work on the log minimal model program for these KSBA moduli spaces with respect to their log canonical divisor. The log MMP for the moduli space of cubic surfaces with a marked line
Tue, Sep. 1 2:30pm (MATH 3…	Lie Theory Richard Green (CU) X A poset congruence is the analogue for partially ordered sets of a lattice congruence. If a group G acts on the underlying set of a poset P, then we call a poset congruence "G-invariant" if the G-action respects the partition of P into congruence classes. This talk will discuss specific examples where G is a Weyl group of type A or D. This is partly based on joint work with Tianyuan Xu (University of Richmond). Invariant poset congruences
Wed, Sep. 2 4:40pm (MATH 3…	Grad Student Seminar Edouard Pierre Francois Heitzmann (CU Boulder) X As part of a recent research problem, I needed a cheap and sharp way to compute anytime-valid refineable lower bounds for directional derivatives of a high-dimensional function over a coordinate diamond. The Interval Branch and Bound (B&B) algorithm turned out to be a good fit for this task. In this talk I will tell you about the Mathematics involved in this algorithm – including the so-called “Fundamental Theorem of Interval Arithmetic” – as well as its history and the context I had to apply it in. A Conservative Optimization Algorithm Using the Fundamental Theorem of Interval Arithmetic
Fri, Sep. 4 1:25pm (Math 3…	A. I. Edgar Costa (MIT) X Large language models become more reliable when surrounded by well-designed instructions, reusable skills, persistent records, and independent checks. I will explain how to build and use these supporting structures for rigorous technical work. How to Tame Your LLM: Harnesses for Rigorous Work
Tue, Sep. 8 11am (MATH 350)	Number Theory Taku Ishii (Seikei University) X Explicit formulas for spherical Whittaker functions on GL(n,R) were obtained by Stade around 1990. As an application, Stade computed archimedean zeta integrals for automorphic L-functions on GL(n)×GL(n) and GL(n)×GL(n-1). In this talk, I will discuss joint work with Stade on extending these results to classical groups. Archimedean Whittaker functions and archimedean zeta integrals Sponsored by the Meyer Fund
Tue, Sep. 8 5pm (MATH 350)	Math Club Rebekah Jones X Come to our first meeting on Tuesday, Sept 8th, 5-6pm to learn about what we do at Math Club and what we have planned for the semester. We’ll also have some fun math games/activities and, as always, free pizza! If you RSVP at the link below, you can vote on your pizza preferences. RSVP link: https://forms.gle/HFgNJZg8RhNfVWJg6 Welcome Day
Wed, Sep. 9 3:30pm (Math350)	Math Phys Andrew Doumont (CU Boulder) X Many techniques for studying symplectic manifolds (e.g. Gromov-Witten invariants) rely on the ability to count certain pseudoholomorphic curves. In order to do this counting one must have some notion of fundamental class on the moduli space of pseudoholomorphic curves. However, such moduli spaces are generally very poorly behaved. In this talk, we will discuss Kuranishi spaces which are a geometric structure one can equip these moduli spaces with in order to define a virtual fundamental class. Kuranishi Space
Fri, Sep. 11 10:10am (Math …	Math Edu Rebekah Jones X Join us to discuss potential topics and speakers for the Seminar on Undergraduate Math Education (SUME) this semester. We encourage all those interested in attending SUME this semester to attend! SUME Open House
Fri, Sep. 11 1:25pm (Math 3…	A. I. Ken Ono (Axiom Math) X Mathematics is entering a period of both promise and unease. AI systems now discover counterexamples and conjectures, produce research-level arguments, and generate formally verified proofs in systems like Lean. This talk offers a working map of the landscape, organized around three distinct modes: discovery, reasoning, and verification, and why confusing them is the fastest way to overclaim. After surveying recent landmarks, I will present case studies from my own work at Axiom Math. I will discuss what is real, what is hype, and how rigor survives. Mathematics in the Age of AI: Discovery, Verification, and the Future of Proof
Tue, Sep. 15 11pm (350)	Number Theory Jamie Juul (Colorado State University) TBA
Fri, Sep. 18 1:25pm (Math 3…	A. I. Gregory Berkolaiko (Texas A&M) TBA
Fri, Sep. 25 1:25pm (Math 3…	A. I. Sachi Hashimoto X New technologies often change our tools before they change the way we work. Large language models can now produce convincing mathematical code very rapidly through mathematical "vibe coding" (prompting AI and then accepting code if it seems to work). But when this code is intended for use in a publication or inclusion in a database, the stakes are higher: errors in the code become errors in the mathematical literature. Is the alternative to "vibe coding" reading the code line-by-line? I will talk about how we can build software development workflows for the AI age. Starting from the basics of version control and Git, and assuming no prior experience, I will discuss iterative AI-assisted development, subagents, code review, testing, and continuous integration. The talk will be aimed at mathematicians interested in developing large-scale mathematical software and databases without giving up oversight and trust. AI-Assisted Coding for Mathematicians: How to Build Software Without Vibe Coding
Tue, Sep. 29 2:30pm (MATH 3…	Lie Theory Katrina Barron (Notre Dame University) TBA Sponsored by the Meyer Fund
Fri, Oct. 2 1:25pm (Math 3…	A. I. TBA TBA
Fri, Oct. 9 1:25pm (Math 3…	A. I. TBA TBA
Tue, Oct. 13 11am (350)	Number Theory Faculty & Postdoc Number Theory Open House
Fri, Oct. 16 1:25pm (Math 3…	A. I. Zak Miller TBA
Fri, Oct. 23 1:25pm (Math 3…	A. I. TBA TBA
Fri, Oct. 30 1:25pm (Math 3…	A. I. TBA TBA
Thu, Nov. 5 2:30pm (MATH 3…	Functional Analysis Alonso Delfin TBA
Fri, Nov. 6 1:25pm (Math 3…	A. I. TBA TBA
Fri, Nov. 13 1:25pm (Math 3…	A. I. Lionel Levine (Cornell University) TBA
Fri, Nov. 20 1:25pm (Math 3…	A. I. TBA TBA
Fri, Dec. 4 1:25pm (Math 3…	A. I. Emily Riehl (Johns Hopkins University) TBA

Main menu

Search

Other ways to search:

Events for September 2026 – January 2027

Algebraic Geometry

Lie Theory

Grad Student Seminar

A. I.

Number Theory

Math Club

Math Phys

Math Edu

A. I.

Number Theory

A. I.

A. I.

Lie Theory

A. I.

A. I.

Number Theory

A. I.

A. I.

A. I.

Functional Analysis

A. I.

A. I.

A. I.

A. I.