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:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221114T161500
DTEND;TZID=America/Los_Angeles:20221114T171500
DTSTAMP:20260518T152613
CREATED:20220919T154642Z
LAST-MODIFIED:20221101T152658Z
UID:2932-1668442500-1668446100@colleges.claremont.edu
SUMMARY:Applied Math Seminar: Jahrul Alum (Memorial University of Newfoundland)
DESCRIPTION:Title: Data-driven large eddy simulation of atmospheric turbulence \nAbstract: Over the last few years\, machine learning has been critical in science and engineering and emerged as a data-driven turbulence model. However\, machine learning depends on training data from previous experiments on turbulent flows. Typically\, training data capture only a fraction of the active scales of turbulence. Despite decades of research\, the best turbulence theory has yet to emerge\, which limits the training of supervised machine learning models. Reinforcement learning is one way to alleviate these challenges. A reinforcement learning model interacts directly with the dynamical system itself. In this talk\, I will use the Burgers equation to illustrate data-driven learning of dynamical systems. Then\, I use simulations of a NACA airfoil and a wind farm to outline the reinforcement learning framework. Finally\, the talk presents a proof of concept for optimizing large eddy simulation through reinforcement learning.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-jahrul-alum-memorial-university-of-newfoundland/
LOCATION:Shanahan 2407 at Harvey Mudd College\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221115T121500
DTEND;TZID=America/Los_Angeles:20221115T131000
DTSTAMP:20260518T152613
CREATED:20220823T003904Z
LAST-MODIFIED:20221102T220943Z
UID:2786-1668514500-1668517800@colleges.claremont.edu
SUMMARY:Minimal Mahler measure in number fields (Kate Petersen\, University of Minnesota Duluth)
DESCRIPTION:The Mahler measure of a polynomial is the modulus of its leading term multiplied by the moduli of all roots outside the unit circle.  The Mahler measure of an algebraic number b\, M(b) is the Mahler measure of its minimal polynomial. By a result of Kronecker\, an algebraic number b satisfies M(b)=1 if and only if b is a root of unity. Famously\, Lehmer asked if there are algebraic numbers with Mahler measures arbitrarily close to 1 (but not equal to 1). We will investigate the minimal Mahler measure of a number field.  For a number field K this is the smallest Mahler measure of a non-torsion generator for K\, written M(K). There are known upper and lower bounds for M(K) in terms of the degree and discriminant of K.  Focusing on cubics\, we will discuss how these bounds correspond to other properties of the number field\, and the sharpness of these bounds.  This is joint work with Lydia Eldredge.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-kate-petersen-university-of-minnesota-duluth/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221116T161500
DTEND;TZID=America/Los_Angeles:20221116T173000
DTSTAMP:20260518T152613
CREATED:20220830T231344Z
LAST-MODIFIED:20221104T225945Z
UID:2808-1668615300-1668619800@colleges.claremont.edu
SUMMARY:Prof. Kate Petersen
DESCRIPTION:Title: Decision Problems in Low-Dimensional Topology \nSpeaker: Kate Petersen\, Department of Mathematics and Statistics\, CSU\, University of Minnesota Duluth \nAbstract: Due to Perelman’s proof of the Geometrization conjecture every closed 3-manifold can be decomposed into geometric pieces. These pieces exhibit one of Thurston’s eight model geometries.  This gives rise to the natural question: Given a 3-manifold how (quickly) can you determine its geometry?  We will discuss this question\, including some recent advances.  This is joint work with Neil Hoffman. \n\n\n\n\n\n\n\n\nMy research interests are in number theory and topology. After completing my undergraduate degree at Oberlin College\, I earned my PhD in 2005 at the University of Texas at Austin under the direction of Alan Reid.  My PhD work was in arithmetic groups\, which bridge number theory and topology.  Following my PhD I had a postdoc at Queen’s University in Kingston Ontario where I worked in number theory with Ram Murty.  I spent a semester visiting the Fields Institute before joining Florida State as a tenure-track Assistant Professor.  I earned tenure there in 2015.  In 2021 I joined the faculty of University of Minnesota Duluth where I am now the head of the Mathematics and Statistics Department.
URL:https://colleges.claremont.edu/ccms/event/kate-petersen/
LOCATION:Humanities Auditorium\, Scripps College\, and Zoom\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
GEO:34.1035221214;-117.709766675
END:VEVENT
END:VCALENDAR