CCMS Colloquium invites you to a talk by Lihong Zhao (Kennesaw State University) Title: Capturing heterogeneity in malaria transmission: an age-structured model with immune feedback and seasonality Abstract: Malaria remains a major […]
This GEMS session will be facilitated by Robbie Tran from Claremont Graduate University. Title: Formulating Equations as a Medium for Digital Art and Design Abstract: As we can utilize letters […]
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 […]
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 […]
No lecture today. Quantitative and Computing Lab (QCL) Math Club Pi Day celebration at Claremont McKenna College at Kravis Lower Court from 11am to 12:30pm.
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. We show that suitable conditions on the observed data guarantee global regularity of the associated system and […]
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 […]
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 […]
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 […]
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 […]
