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-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:20260330T161500
DTEND;TZID=America/Los_Angeles:20260330T171500
DTSTAMP:20260515T145921
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:20260515T145921
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
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260402T161500
DTEND;TZID=America/Los_Angeles:20260402T171500
DTSTAMP:20260515T145921
CREATED:20260327T214850Z
LAST-MODIFIED:20260327T214850Z
UID:4063-1775146500-1775150100@colleges.claremont.edu
SUMMARY:Analysis Seminar: Restricted isometries and operator norms on finite-dimensional $L^p$-spaces (Alonso Delfín Ares de Parga\, CU Boulder)
DESCRIPTION:Abstract: An isometry between two normed vector spaces is a linear map that preserves the norm (i.e.\, the length of each output agrees with the length of its input). For the classical $p$-norms\, isometries have a very concrete description when $p\neq 2$: they are given by signed permutations of the coordinates. \nIn this talk\, I will present a generalization of this result to restricted isometries\, which are linear maps that preserve the norm only on a fixed subset of coordinates. I will discuss how this generalization could be used in the computation of certain $p$-operator norms\, a problem that is known to be NP-hard in general. \nThis talk includes joint work carried out as part of two REU projects in 2024 and 2025.
URL:https://colleges.claremont.edu/ccms/event/analysis-seminar-restricted-isometries-and-operator-norms-on-finite-dimensional-lp-spaces-alonso-delfin-ares-de-parga-cu-boulder/
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:20260403T110000
DTEND;TZID=America/Los_Angeles:20260403T121500
DTSTAMP:20260515T145921
CREATED:20260110T220851Z
LAST-MODIFIED:20260303T022823Z
UID:3949-1775214000-1775218500@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Puttipong Pongtanapaisan (Pitzer)
DESCRIPTION:CCMS Colloquium invites you to a talk by Puttipong Pongtanapaisan (Pitzer)\n\n \nTitle:  Derivatives and the Shape of Graphs\n \nAbstract:  Reading the title of this talk\, perhaps you think you are going to hear about Calculus I. I stole the title from a section of Stewart’s popular calculus book. But actually\, I am going to talk about geometry and topology\, and the root idea already appears in Calculus I. In real life\, shapes such as proteins and DNA can be tangled up in space. These can be modeled as graphs embedded in three-dimensional space\, and some applied mathematicians also call these networks. In calculus\, you learn that information about derivatives\, such as the number of local maxima and where they appear\, tells us a great deal about the graph itself. I am going to apply this same philosophy to knotted graphs in three-dimensional space and demonstrate that one protein is more complexly entangled than another.\n \nBio: Puttipong Pongtanapaisan obtained his Ph.D. at the University of Iowa\, where he studied low-dimensional topology under the supervision of Dr. Maggy Tomova. His previous positions include a PIMS Postdoctoral Fellow at the University of Saskatchewan and a Postdoctoral Associate at Arizona State University. His research explores knotted shapes in confinement by analyzing the arrangement of local maxima and minima.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-puttipong-pongtanapaisan-pitzer/
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:20260404T100000
DTEND;TZID=America/Los_Angeles:20260404T115500
DTSTAMP:20260515T145921
CREATED:20260312T200921Z
LAST-MODIFIED:20260312T200921Z
UID:4035-1775296800-1775303700@colleges.claremont.edu
SUMMARY:GEMS April 4th Session
DESCRIPTION:This GEMS session will be facilitated by Evan Rosenman from Claremont McKenna College \n\n\n\nTitle: Fair Votes? The Mathematics of Elections and Redistricting\n\n\nAbstract: How do we know if an election is fair? In this interactive session\, we’ll explore how math helps us answer that question. Students will experiment with drawing voting districts to see how drawing different district boundaries can change outcomes. They will also learn about alternative voting systems\, such as ranked choice voting and approval voting\, and how these might yield more representative outcomes than traditional “first-past-the-post” elections. Along the way\, we’ll encounter ideas like Condorcet winners\, and see how Statistics can help us learn about voting patterns from limited data. Join us to discover how geometry\, algorithms\, and probability shape modern elections.
URL:https://colleges.claremont.edu/ccms/event/gems-april-4th-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
END:VCALENDAR