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:20260302T161500
DTEND;TZID=America/Los_Angeles:20260302T171500
DTSTAMP:20260406T144901
CREATED:20260224T233444Z
LAST-MODIFIED:20260224T233444Z
UID:4007-1772468100-1772471700@colleges.claremont.edu
SUMMARY:Structure-Preserving Discretizations for Fokker–Planck Equations via the Energy Dissipation Law (Satish Chandran\, UCR)
DESCRIPTION:Abstract: We present a new approach for deriving structure-preserving numerical discretizations of Fokker-Planck equations by establishing a connection between the Fokker-Planck equation and its semi-discrete master equation at the level of the energy-dissipation law. We determine the transition rate in the master equation via the detailed balance condition and the spatial discretization of the continuous energy-dissipation law. This approach ensures that the semi-discrete master equation satisfies the detailed balance condition and converges to the correct equilibrium. In addition to recovering existing transition rates proposed in earlier works\, our framework uncovers new transition rates that have not been discussed in the current literature. This work is joint with Dr. Yiwei Wang (UCR).
URL:https://colleges.claremont.edu/ccms/event/structure-preserving-discretizations-for-fokker-planck-equations-via-the-energy-dissipation-law-satish-chandran-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:20260303T121500
DTEND;TZID=America/Los_Angeles:20260303T131000
DTSTAMP:20260406T144901
CREATED:20260302T023221Z
LAST-MODIFIED:20260302T023221Z
UID:4013-1772540100-1772543400@colleges.claremont.edu
SUMMARY:On a new version of Siegel’s lemma  (Lenny Fukshansky\, CMC)
DESCRIPTION:The classical Siegel’s lemma (1929) asserts the existence of a nontrivial integer solution to an underdetermined integer homogeneous linear system\, whose “size” is small as compared to the size of the coefficients of the system. Far-reaching generalizations of this theorem\, producing a full basis for the solution space\, were obtained over number fields by Bombieri & Vaaler (1983)\, and over the field of algebraic numbers by Roy & Thunder (1996)\, where the “size” was measured by a height function. We obtain a new version of Siegel’s lemma\, bridging the Bombieri & Vaaler and Roy & Thunder results in two ways: (1) our basis lies over a fixed number field as in Bombieri & Vaaler’s theorem; (2) our height-bound does not depend on the number field in question as in Roy & Thunder’s theorem. Our result does not imply the previously established ones and is not implied by them\, and our basis has some additional interesting properties. Our method is quite different from the previous ones\, using only linear algebra. Joint work with Max Forst.
URL:https://colleges.claremont.edu/ccms/event/on-a-new-version-of-siegels-lemma-lenny-fukshansky-cmc/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260306T110000
DTEND;TZID=America/Los_Angeles:20260306T121500
DTSTAMP:20260406T144901
CREATED:20260110T234502Z
LAST-MODIFIED:20260304T161508Z
UID:3950-1772794800-1772799300@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Lihong Zhao (Kennesaw State University)
DESCRIPTION:CCMS Colloquium invites you to a talk by Lihong Zhao (Kennesaw State University)\n\n \nTitle: Capturing heterogeneity in malaria transmission: an age-structured model with immune feedback and seasonality\n \nAbstract: Malaria remains a major global health burden\, causing more than 600\,000 deaths and over 249 million cases globally each year. Heterogeneity in malaria transmission is a critical factor that influences the dynamics of disease emergence and the effectiveness of possible control strategies. In this talk\, I will present an age-structured model that couples vector-host epidemiological dynamics with immune feedback and how we use it to characterize seasonal malaria transmission and assess the impact of vaccination strategies. We also extend this model to explore how different mobility patterns and immunity profiles interact to impact the risk of severe infection and prevalence.\n \nBio: Dr. Lihong Zhao is an Assistant Professor of Mathematics at Kennesaw State University (KSU). Prior to her position at KSU\, she was a Visiting Assistant Professor in the Department of Mathematics at Virginia Tech and an NSF DIRAC-RTG postdoctoral fellow in the Department of Applied Mathematics at the University of California\, Merced. She develops and analyzes mathematical and computational models to examine questions in life sciences. Most of her work focuses on infectious disease epidemiology and ecology.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-lihong-zhao-kennesaw-state-university/
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:20260307T100000
DTEND;TZID=America/Los_Angeles:20260307T115500
DTSTAMP:20260406T144901
CREATED:20260207T052658Z
LAST-MODIFIED:20260307T001548Z
UID:3987-1772877600-1772884500@colleges.claremont.edu
SUMMARY:GEMS March 7th Session
DESCRIPTION:This GEMS session will be facilitated by Robbie Tran from Claremont Graduate University.\n\n\nTitle: Formulating Equations as a Medium for Digital Art and Design\n\n\nAbstract: \nAs we can utilize letters and words to write out mathematics (e.g. 2+2=4 can be written as “two plus two is equal to four”)\, this session seeks to explore the near reverse: how can we use mathematics to some extent graph letters and words? Rather\, could we formulate equations of curves that visually resemble text on a 2D-plane? If we include both conventional and nonconventional shapes too\, this question is not only an interesting curiosity\, but a question whose answer is quite prevalent in programs for computer graphics\, animation\, digital art\, and font design!\n\nWe will approach this question by highlighting and constructing Bézier curves\, which can approximate smooth curves by control (anchor) points on the plane. Furthermore\, this session will showcase the mathematics of these curves\, covering polynomials\, linear interpolation\, and parametrization (no prior knowledge assumed). Ultimately\, we will simulate how graphs of Bézier curves can be drawn for various letters and shapes by applying a recursive method called de Casteljau’s algorithm. Join us to explore an example of how mathematics can serve as a gateway to art and design!
URL:https://colleges.claremont.edu/ccms/event/gems-march-7th-session/
LOCATION:Shanahan 1480\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:GEMS
ORGANIZER;CN="Teal Witter":MAILTO:raylen.witter@claremontmckenna.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260309T161500
DTEND;TZID=America/Los_Angeles:20260309T171500
DTSTAMP:20260406T144901
CREATED:20260303T213300Z
LAST-MODIFIED:20260310T191340Z
UID:4022-1773072900-1773076500@colleges.claremont.edu
SUMMARY:An Odd Estimator for Shapley Values (Teal Witter\, CMC)
DESCRIPTION:Abstract: The Shapley value is a ubiquitous framework for attribution in machine learning\, encompassing feature importance\, data valuation\, and causal inference. However\, its exact computation is generally intractable\, necessitating efficient approximation methods. While the most effective and popular estimators leverage the paired sampling heuristic to reduce estimation error\, the theoretical mechanism driving this improvement has remained opaque. In this work\, we provide an elegant and fundamental justification for paired sampling: we prove that the Shapley value depends exclusively on the odd component of the set function\, and that paired sampling orthogonalizes the regression objective to filter out the irrelevant even component. Leveraging this insight\, we propose OddSHAP\, a novel consistent estimator that performs polynomial regression solely on the odd subspace. By utilizing the Fourier basis to isolate this subspace and employing a proxy model to identify high-impact interactions\, OddSHAP overcomes the combinatorial explosion of higher-order approximations. Through an extensive benchmark evaluation\, we find that OddSHAP achieves state-of-the-art estimation accuracy.\n\nJoint work with Fabian Fumagalli\, Landon Butler\, Justin Singh Kang\, and Kannan Ramchandran.
URL:https://colleges.claremont.edu/ccms/event/an-odd-estimator-for-shapley-values-teal-witter-cmc/
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:20260310T123000
DTEND;TZID=America/Los_Angeles:20260310T131000
DTSTAMP:20260406T144901
CREATED:20260119T182717Z
LAST-MODIFIED:20260307T023545Z
UID:3961-1773145800-1773148200@colleges.claremont.edu
SUMMARY:Hecke algebras and motives (Robert Cass\, CMC)
DESCRIPTION:Hecke algebras play a central role in both number theory and representation theory. While some Hecke algebras have explicit descriptions in terms of generators and relations\, others are understood through structure constants that encode multiplicities in tensor products of representations. In this talk\, I will discuss several projects with Thibaud van den Hove and Jakob Scholbach aimed at using geometry and motives to give a uniform categorification of Hecke algebras. Along the way\, we will encounter the geometric Satake equivalence\, Gaitsgory’s central functor\, and Iwahori-Whittaker models.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-robert-cass-cmc-2/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260313T110000
DTEND;TZID=America/Los_Angeles:20260313T121500
DTSTAMP:20260406T144901
CREATED:20260110T234636Z
LAST-MODIFIED:20260313T054744Z
UID:3951-1773399600-1773404100@colleges.claremont.edu
SUMMARY:NO CCMS Colloquium: Pi Day at CMC
DESCRIPTION:No lecture today. \n  \nQuantitative and Computing Lab (QCL) Math Club Pi Day celebration at Claremont McKenna College at Kravis Lower Court from 11am to 12:30pm. \n 
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-2/
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:20260320T110000
DTEND;TZID=America/Los_Angeles:20260320T121500
DTSTAMP:20260406T144901
CREATED:20260110T234749Z
LAST-MODIFIED:20260110T234749Z
UID:3952-1774004400-1774008900@colleges.claremont.edu
SUMMARY:NO CCMS Colloquium - SPRING BREAK
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/no-ccms-colloquium-spring-break/
LOCATION:CA
CATEGORIES:Colloquium
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260323T161500
DTEND;TZID=America/Los_Angeles:20260323T171500
DTSTAMP:20260406T144901
CREATED:20260320T193527Z
LAST-MODIFIED:20260320T193527Z
UID:4056-1774282500-1774286100@colleges.claremont.edu
SUMMARY:A Regularity Criterion for the 3-D Navier-Stokes Equations Based on Finitely Many Observations (Abhishek Balakrishna\, USC)
DESCRIPTION:Abstract: This talk presents a regularity criterion for the three-dimensional Navier–Stokes equations based on finitely many observations of the flow. Motivated by data assimilation\, we study a nudging algorithm that incorporates coarse spatial measurements through general interpolation operators. \nWe show that suitable conditions on the observed data guarantee global regularity of the associated system and yield an exponential tracking property. As a consequence\, we obtain a new regularity criterion for weak solutions formulated entirely in terms of finitely many observables\, covering modal\, volume\, and nodal measurements.
URL:https://colleges.claremont.edu/ccms/event/a-regularity-criterion-for-the-3-d-navier-stokes-equations-based-on-finitely-many-observations-abhishek-balakrishna-usc/
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:20260324T121500
DTEND;TZID=America/Los_Angeles:20260324T131000
DTSTAMP:20260406T144901
CREATED:20260209T235439Z
LAST-MODIFIED:20260226T211019Z
UID:3991-1774354500-1774357800@colleges.claremont.edu
SUMMARY:Computing certificates for complete positivity (Achill Schürmann\, University of Rostock)
DESCRIPTION:A key problem in computer proofs based on solutions from copositive optimization\, is checking whether or not a given quadratic form is completely positive or not. In this talk we describe the first known algorithm for arbitrary rational input. It is based on a suitable adaption of Voronoi’s Algorithm and the underlying theory from positive definite to copositive quadratic forms. We observe several similarities with the classical theory\, but also some differences\, in particular for three and more variables. A key element and currently the main bottleneck in our algorithm is an adapted shortest vector computation\, asking for all nonnegative integer vectors attaining the copositive minimum of a given copositive quadratic form. \n(based on joint work with Valentin Dannenberg\, Alexander Oertel\, Mathieu Dutour Sikiric and Frank Vallentin)
URL:https://colleges.claremont.edu/ccms/event/antc-talk-achill-schurmann-university-of-rostock/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260324T161500
DTEND;TZID=America/Los_Angeles:20260324T171500
DTSTAMP:20260406T144901
CREATED:20260316T040720Z
LAST-MODIFIED:20260316T040956Z
UID:4048-1774368900-1774372500@colleges.claremont.edu
SUMMARY:Analysis Seminar: Metrics on quantum channels from noncommutative geometry (Tron Omland\, University of Oslo and Norwegian National Security Authority)
DESCRIPTION:Abstract: We study metrics on completely positive maps\, and in particular on quantum channels\, induced by seminorms from noncommutative geometry. Using an infinite-dimensional analogue of the Choi–Jamiołkowski correspondence\, we construct such metrics and show that\, under suitable assumptions\, they satisfy stability and chaining. I will present the main ideas and explain how spectral triples and related constructions give rise to distances between quantum processes. This is joint work with Austad\, Bedos\, Eidesen\, and Larsen.
URL:https://colleges.claremont.edu/ccms/event/analysis-seminar-metrics-on-quantum-channels-from-noncommutative-geometry-tron-omland-university-of-oslo-and-norwegian-national-security-authority/
LOCATION:Estella 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, United States
CATEGORIES:Analysis Seminar
ORGANIZER;CN="Asuman Aksoy":MAILTO:asuman.aksoy@claremontmckenna.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260327T110000
DTEND;TZID=America/Los_Angeles:20260327T121500
DTSTAMP:20260406T144901
CREATED:20260110T234844Z
LAST-MODIFIED:20260313T054308Z
UID:3953-1774609200-1774613700@colleges.claremont.edu
SUMMARY:NO CCMS Colloquium - Cesar Chavez Day
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-3/
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:20260330T161500
DTEND;TZID=America/Los_Angeles:20260330T171500
DTSTAMP:20260406T144901
CREATED:20260317T221754Z
LAST-MODIFIED:20260317T221754Z
UID:4051-1774887300-1774890900@colleges.claremont.edu
SUMMARY:The Euler Equations in Function Spaces of Generalized Smoothness (Zachary Radke\, OSU)
DESCRIPTION:Abstract: In this talk\, we will describe a well/ill-posedness result for the 2D incompressible Euler equations. We investigate solutions in a setting logarithmically smoother than previously done\, in a hope to identify the key dynamics leading to a breakdown of regularity in 2D fluid flow. When order of the logarithmic derivative is sufficiently large one obtains global well posedness\, however\, below this threshold\, one can construct initial data for which the corresponding solution blows up instantaneously in the logarithmic Sobolev norm. In this sense\, the result is sharp at this logarithmic scale\, but by no means is the story completed by it so we will discuss ways to dive deeper.
URL:https://colleges.claremont.edu/ccms/event/the-euler-equations-in-function-spaces-of-generalized-smoothness-zachary-radke-osu/
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:20260331T121500
DTEND;TZID=America/Los_Angeles:20260331T131000
DTSTAMP:20260406T144901
CREATED:20260106T162953Z
LAST-MODIFIED:20260321T145212Z
UID:3941-1774959300-1774962600@colleges.claremont.edu
SUMMARY:Central moments of autocorrelation demerit factors of binary sequences (Daniel Katz\, CSUN)
DESCRIPTION:A low autocorrelation binary sequence of length $\ell$ is an $\ell$-tuple of $+1$s and $-1$s that does not strongly resemble any translate of itself.  Such sequences are used in communications and remote sensing for synchronization and ranging\, where translation represents time delay.  A single number that indicates how good a sequence is for such purposes\, called the merit factor\, was introduced by Golay.  Its reciprocal is the demerit factor\, which is more natural to analyze due to its connection with norms of polynomials on the complex unit circle.  We consider the uniform probability measure on the $2^\ell$ binary sequences of length $\ell$ and investigate the distribution of the demerit factors of these sequences.  Sarwate and Jedwab have respectively calculated the mean and variance of this distribution. For each positive integer $p$\, we derive a formula for the $p$th central moment of the demerit factor for the binary sequences of length $\ell$; this is $\ell^{-2 p}$ times a quasipolynomial function of $\ell$.  The derivations rely on new combinatorial techniques\, assisted by group theory and Ehrhart theory\, and show that all the central moments are strictly positive for $p\geq 2$ and $\ell \geq 4$. Jedwab’s formula for variance is confirmed\, and we go beyond previous results by also deriving an exact formula for the skewness (by hand) and for the kurtosis and the fifth moment (by computer).  We obtain asymptotic values for all central moments in the limit as the length $\ell$ of the sequences tends to infinity.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-daniel-katz-csun/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR