We welcome all undergraduate/graduate students and faculty to attend topology seminar! Speaker: Chris Grossack (UC Riverside) Title: Explicitly Computing Fukaya Categories of Surfaces Abstract: Fukaya categories are rich and interesting invariants of symplectic manifolds that are often difficult to compute in practice. In the case of surfaces, however, the computation becomes pleasantly combinatorial, and can […]
CCMS Colloquium invites you to a talk by Shriya Nagpal (Pitzer) Title: Synchronization in Erdős–Rényi Graphs with Kuramoto Dynamics: A Graphon Approach Abstract: Networks of coupled Kuramoto oscillators have been used to model a wide array of phenomena, including circadian rhythms, flashing fireflies, and high-voltage electric grids. In many such applications, synchronization is an emergent behavior […]
We'll be back next week! Happy Thanksgiving!
Abstract: Modern machine learning and scientific computing pose optimization challenges of unprecedented scale and complexity, demanding fundamental advances in both theory and algorithmic design for nonconvex optimization. This talk presents recent advances that address these challenges by exploiting matrix and tensor structures, integrating adaptivity, and leveraging sampling techniques. In the first part, I introduce AdaGO, […]
Hunter's theorem ensures that the complete homogeneous symmetric (CHS) polynomials of even degree are positive definite functions. We provide new proofs of Hunter's theorem, applications to operator theory, and a noncommutative (NC) generalization that sheds light even on the commutative case. Surprisingly, this work emerged from a problem in analytic combinatorics.
We welcome all undergraduate/graduate students and faculty to attend topology seminar! Speaker: Indraneel Tambe (UCLA) Title: Steinberg skein relations at roots of unity Abstract: This talk discusses some of the relationships between skein theory and the representation theory of quantum sl2 when q is a root of unity. Specifically, I focus on the Frobenius pullback […]
CCMS Colloquium invites you to a talk by Konstantin Zuev (Caltech) Title: Course-Prerequisite Networks Abstract: An academic curriculum is a complex system of courses and their interactions that lies at the heart of an academic institution and underlies its educational mission. Understanding these systems is essential for providing high-quality education. Course-prerequisite networks (CPNs) are directed […]
This GEMS session will be facilitated by Professor Ryan Aschoff from the Claremont Graduate University. Title: Randomness: Creating Order from Chaos Abstract: From the hiss of white noise to the […]
Abstract: The talk introduces a conjecture on the first exit time of fractional Brownian motion: the upper-tail probability for a fractional Brownian motion to first exit a positive-valued barrier over time […]
Virtual links can be represented as equivalence classes of Gauss diagrams under Reidemeister moves. The Forbidden Moves are moves which look plausible but change the virtual isotopy class of the […]
Abstract: A proper coloring of a graph is an assignment of colors from \( \{1, 2, \ldots, k\} \) to each node of a graph such that no two nodes connected by an edge receive the same color. Let \( \Delta \) denote the maximum degree of the graph. If \( k \geq \Delta + […]
CCMS Colloquium invites you to a talk by John Baez (UCR) Title: The mathematics of tuning systems Abstract: Leibniz said "Music is the pleasure the human mind experiences from counting without being aware that it is counting." The first step is choosing a tuning system — the frequency ratios between pitches in a scale. Different kinds […]
