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 […]
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 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 […]
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 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 […]
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 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 […]
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.
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 […]
CCMS Colloquium invites you to a talk by Puttipong Pongtanapaisan (Pitzer) Title: Derivatives and the Shape of Graphs Abstract: Reading the title of this talk, perhaps you think you are […]
This GEMS session will be facilitated by Evan Rosenman from Claremont McKenna College Title: Fair Votes? The Mathematics of Elections and Redistricting Abstract: How do we know if an election is fair? […]
