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:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200201T100000
DTEND;TZID=America/Los_Angeles:20200201T120000
DTSTAMP:20260409T230250
CREATED:20200113T212715Z
LAST-MODIFIED:20200116T232700Z
UID:1752-1580551200-1580558400@colleges.claremont.edu
SUMMARY:GEMS Workshop: Superheroes vs. Supercomputers with Professor Jeho Park of Claremont McKenna College
DESCRIPTION:  \n\n\n\nTOPIC: Superheroes vs. Supercomputers \nSuperheroes like Wonder Woman\, Black Panther\, Superman\, and Captain Marvel\, just to name a few\, all have “super” power and they save the world from “super”-villains. Well\, just one catch–they are not real. In our real world\, there are computers built for super power to save the (real) world. In this talk\, you will be introduced to “super”computers built to defeat “super”villains (i.e.\, super difficult problems). To understand supercomputing\, you will learn some (or all) of the following exciting terms and theories (which are not commonly discussed in high school classrooms): cluster\, GPU\, parallel processing\, decomposition\, shared memory\, distributed memory\, Amdahl’s law\, big data\, artificial intelligence\, deep learning\, machine learning\, and data science. \nWHAT IS GEMS: \nThe Gateway to Exploring Mathematics program (GEMS) is a series of workshops that helps excite the interests and curiosity of young students in mathematics and science \nGEMS meets once a month on a Saturday morning from 10:00 AM to 12:00 PM \nGEMS is designed to reach 8th\, 9th and 10th grade students who have an interest in mathematics and science \nParticipants interact with excellent and award winning faculty\, staff\, students and alumni from each of the seven Claremont Colleges \nSPRING 2020 DATES: \nFebruary 1\, 2020 \nMarch 7\, 2020 \nApril 18\, 2020 \nREGISTRATION: \nTo register for our next event on February 1\, please click on the following link: \nhttps://forms.gle/14wMcsV5iUGN5mqNA \nANY QUESTIONS: \nPlease contact our 2019-2020 GEMS coordinator\, Josh Kiernan at joshua.kiernan@cgu.edu
URL:https://colleges.claremont.edu/ccms/event/gems-workshop-superheroes-vs-supercomputers-with-professor-jeho-park-of-claremont-mckenna-college/
LOCATION:Shanahan 1480\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:GEMS
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200204T121500
DTEND;TZID=America/Los_Angeles:20200204T131000
DTSTAMP:20260409T230250
CREATED:20200129T003031Z
LAST-MODIFIED:20200129T003031Z
UID:1831-1580818500-1580821800@colleges.claremont.edu
SUMMARY:Covering point-sets with parallel hyperplanes and sparse signal recovery (Lenny Fukshansky\, CMC)
DESCRIPTION:Let S be a set of k > n points in n-dimensional Euclidean space. How many parallel hyperplanes are needed to cover it? In fact\, it is easy to prove that every such set can be covered by k-n+1 parallel hyperplanes\, but do there exist sets that cannot be covered by fewer parallel hyperplanes? We construct a family of examples of such extremal sets. We then use it\, along with a result on girth of bipartite graphs\, to construct a family of n x d integer matrices with bounded sup-norm and the property that no m column vectors are linearly dependent\, m < n. If m < (log n)^{1-e} for any e > 0\, then d/n tends to infinity as n tends to infinity. This is a deterministic construction of a family of sensing matrices\, which are used for sparse signal recovery in compressed sensing. Joint work with Alex Hsu.
URL:https://colleges.claremont.edu/ccms/event/covering-point-sets-with-parallel-hyperplanes-and-sparse-signal-recovery-lenny-fukshansky-cmc/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200204T150000
DTEND;TZID=America/Los_Angeles:20200204T160000
DTSTAMP:20260409T230250
CREATED:20191219T182743Z
LAST-MODIFIED:20200121T223340Z
UID:1697-1580828400-1580832000@colleges.claremont.edu
SUMMARY:Tommaso Cremaschi (USC)
DESCRIPTION:Title: Volumes and filling collections of multicurves\n\n\n\n\nAbstract: In this talk we will be concerned with links L in a Seifert-Fibered space N such that their projection to the base surface is a collection of curves G in minimal position. After stating a hyperbolization result\, for the complement of L\, in terms of G we will study the volume of their complement and give combinatorial asymptotics. We will be particularly interested in the case where N is the projective tangent bundle of a hyperbolic surface. This is joint work with J.A. Rodrigues-Migueles and A. Yarmola.
URL:https://colleges.claremont.edu/ccms/event/tommaso-cremaschi-usc/
LOCATION:CA
CATEGORIES:Topology Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200205T161500
DTEND;TZID=America/Los_Angeles:20200205T171500
DTSTAMP:20260409T230250
CREATED:20190830T174047Z
LAST-MODIFIED:20200203T185415Z
UID:1434-1580919300-1580922900@colleges.claremont.edu
SUMMARY:Kernel approaches in global statistical distances\, local measure detection\, and active learning
DESCRIPTION:In this talk\, we’ll discuss the problem of constructing meaningful distances between probability distributions given only finite samples from each distribution.  We approach this through the use of data-adaptive and localized kernels\, and in a variety of contexts.  First\, we construct locally adaptive kernels to define fast pairwise distances between distributions\, with applications to unsupervised clustering.  Then\, we construct localized kernels to determine a statistical framework for determining where two distributions differ\, with applications to measure detection for generative models.  Finally\, we’ll begin to address the question of measure detection without a priori known labels of which distribution a point came from.  This is addressed through active learning\, in which one can choose a small number of points at which to query a label.  This is ongoing work with Xiuyuan Cheng (Duke) and Hrushikesh Mhaskar (CGU)\, among others.
URL:https://colleges.claremont.edu/ccms/event/alex-cloninger/
LOCATION:Freeberg Forum\, LC 62\, Kravis Center\, CMC
CATEGORIES:Colloquium
ORGANIZER;CN="Blerta Shtylla":MAILTO:shtyllab@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200210T161500
DTEND;TZID=America/Los_Angeles:20200210T171500
DTSTAMP:20260409T230250
CREATED:20200128T002046Z
LAST-MODIFIED:20200131T221151Z
UID:1808-1581351300-1581354900@colleges.claremont.edu
SUMMARY:Applied Math Talk: Robust Estimators for Monte Carlo data given by Prof.  Mark Huber (CMC)
DESCRIPTION:Data coming from Monte Carlo experiments is often analyzed in the same way as data from more traditional sources.  The unique nature of Monte Carlo data\, where it is easy to take a random number of samples\, allows for estimators where the user can control the relative error of the estimate much more precisely than with classical approaches.  In this talk I will discuss three such estimators useful in different problems.  The first is a user-specified-relative-error (USRE) estimate for the mean of a Bernoulli random variable.  This allows us to obtain exact error results while using slightly fewer samples than the CLT approximation.  The second is more general\, applying to any random variable where a bound on the relative error is known.  For this problem we give exact error bounds using a number of samples that is the same (to first order) as the CLT approximation requires.  In other words\, the new algorithm is the equivalent of always actually having normal data.  Finally\, we look at the problem of data with unknown variance and develop an algorithm that runs very close to the minimum number of samples established by results of Wald.  
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-mark-huber/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200211T121500
DTEND;TZID=America/Los_Angeles:20200211T131000
DTSTAMP:20260409T230250
CREATED:20200129T000815Z
LAST-MODIFIED:20200202T234446Z
UID:1823-1581423300-1581426600@colleges.claremont.edu
SUMMARY:Quandle module quivers (Sam Nelson\, CMC)
DESCRIPTION:Quandle coloring quivers categorify the quandle counting invariant. In this talk we enhance the quandle coloring quiver invariant with quandle modules\, generalizing both the quiver invariant and the quandle module polynomial invariant. This is joint work with Karma Istanbouli (Scripps College).
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-sam-nelson-cmc/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200212T161500
DTEND;TZID=America/Los_Angeles:20200212T171500
DTSTAMP:20260409T230250
CREATED:20190830T174207Z
LAST-MODIFIED:20200210T182301Z
UID:1436-1581524100-1581527700@colleges.claremont.edu
SUMMARY:Applications of Markov Chains to Swarm Robotics and Political Redistricting
DESCRIPTION:What do swarm robotics and political redistricting have in common? One answer is Markov chains\, which have recently been used in very different ways to address problems in both these areas. To get a large swarm to exhibit a desired behavior\, one solution is to make each individual in the swarm fairly intelligent; another is to make the individuals simple\, but to let the desired behavior emerge as a result of their interactions. My collaborators and I recently used Markov chains and ideas from statistical physics to develop distributed algorithms that follow this second paradigm.  We also worked with physicists to create a physical robot system where each individual cannot compute anything\, but the system as a whole can still accomplish complex tasks. For political redistricting\, the main mathematical technique developed in the last few years for detecting gerrymandering is to compare a proposed plan to the space of all possible alternative plans; if the proposed plan is an outlier\, that’s an indicator it might be gerrymandered. However\, the space of all possible districting plans is far too large to ever be studied in its entirety.  Instead\, Markov chains are used to generate random samples of alternative plans\, where the hope is that the sampled plans are reasonably representative of all possible plans. This approach has already been used successfully in court cases around the country\, though questions still remain about what mathematical guarantees we can give about the randomly sampled districting plans.
URL:https://colleges.claremont.edu/ccms/event/tba-16/
LOCATION:Freeberg Forum\, LC 62\, Kravis Center\, CMC
CATEGORIES:Colloquium
ORGANIZER;CN="Blerta Shtylla":MAILTO:shtyllab@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200217T161500
DTEND;TZID=America/Los_Angeles:20200217T171500
DTSTAMP:20260409T230250
CREATED:20200117T182454Z
LAST-MODIFIED:20200204T175507Z
UID:1774-1581956100-1581959700@colleges.claremont.edu
SUMMARY:Applied Math Talk: Information Theory\, Archetypal Analysis and MT Flu given by Professor Emily Stone (University of Montana-Missoula)
DESCRIPTION:In this talk I will discuss a rather unique collection of tools and how they have been used to understand the spread of Influenza virus in the State of Montana.  With flu counts from each county over a 10 year period some patterns emerge\, which explain some vectors of the disease spread.  Archetypal analysis then creates reduced dimension sets\, and the dynamics of the flu spread can be understood by parameterizing SIR models with the reduced data.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-professor-emily-stone-university-of-montana/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200218T121500
DTEND;TZID=America/Los_Angeles:20200218T131000
DTSTAMP:20260409T230250
CREATED:20191221T204555Z
LAST-MODIFIED:20200201T061024Z
UID:1699-1582028100-1582031400@colleges.claremont.edu
SUMMARY:On badly approximable numbers (Nikolai Moshchevitin\, Moscow State University)
DESCRIPTION:It is well known that a real number is badly approximable if and only if the partial quotients in its continued fraction expansion are bounded. Motivated by a recent wonderful paper by Ngoc Ai Van Nguyen\, Anthony Poels and Damien Roy (where the authors give a simple alternative solution of Schmidt-Summerer’s problem) we found an unusual generalization of this criterion for badly approximable d-dimensional vectors.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-nikolai-moshchevitin-moscow-state-university/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200218T150000
DTEND;TZID=America/Los_Angeles:20200218T150000
DTSTAMP:20260409T230250
CREATED:20200211T172146Z
LAST-MODIFIED:20200211T172146Z
UID:1865-1582038000-1582038000@colleges.claremont.edu
SUMMARY:Ken Millett (UCSB)
DESCRIPTION:Gordian Knots \nAccording to the legend of Phrygian Gordium\, Alexander the Great cut the “Gordian Knot’’ and eventually went on to rule Asia thereby fulfilling an ancient prophecy.  Where there are several descriptions of the precise nature of the Gordian Knot and Alexander’s action\, an explicit mathematical treatment (the theory of thick knots) and the reasons for its contemporary interest will be discussed.  The first simple example of such a Gordian Knotted Structure supported by a rigorous mathematical analysis will be presented.
URL:https://colleges.claremont.edu/ccms/event/ken-millett-ucsb/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
ORGANIZER;CN="Helen Wong":MAILTO:hwong@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200218T150000
DTEND;TZID=America/Los_Angeles:20200218T160000
DTSTAMP:20260409T230250
CREATED:20200127T151809Z
LAST-MODIFIED:20200211T172222Z
UID:1797-1582038000-1582041600@colleges.claremont.edu
SUMMARY:Kenneth Millett (University of California\, Santa Barbara)
DESCRIPTION:Gordian Knots According to the legend of Phrygian Gordium\, Alexander the Great cut the “Gordian Knot’’ and eventually went on to rule Asia thereby fulfilling an ancient prophecy.  Where there are several descriptions of the precise nature of the Gordian Knot and Alexander’s action\, an explicit mathematical treatment (the theory of thick knots) and the reasons for its contemporary interest will be discussed.  The first simple example of such a Gordian Knotted Structure supported by a rigorous mathematical analysis will be presented.  
URL:https://colleges.claremont.edu/ccms/event/kenneth-millett-university-of-california-santa-barbara/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Topology Seminar
ORGANIZER;CN="Helen Wong":MAILTO:hwong@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200219T161500
DTEND;TZID=America/Los_Angeles:20200219T171500
DTSTAMP:20260409T230250
CREATED:20190830T174311Z
LAST-MODIFIED:20200216T235639Z
UID:1438-1582128900-1582132500@colleges.claremont.edu
SUMMARY:Nano Knot theory\, methods to study tiny knot in nature
DESCRIPTION:Knotting in living organisms is a feature that is visible to the careful observer of biological life.  Since the 1970’s\, with the increasing power of electron microscopes\, scientists have been able to capture images of such structures in living organisms at near atomic levels.  We will explore the mathematics of knotting that has provided tools study these phenomena and\, time permitting\, describe new methods being developed to analyze these spatial structure.  
URL:https://colleges.claremont.edu/ccms/event/ken-millett/
LOCATION:Freeberg Forum\, LC 62\, Kravis Center\, CMC
CATEGORIES:Colloquium
ORGANIZER;CN="Blerta Shtylla":MAILTO:shtyllab@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200225T121500
DTEND;TZID=America/Los_Angeles:20200225T131000
DTSTAMP:20260409T230250
CREATED:20190809T161558Z
LAST-MODIFIED:20200202T224846Z
UID:1355-1582632900-1582636200@colleges.claremont.edu
SUMMARY:Discrepancy theory and related questions (Dmitriy Bilyk\, University of Minnesota)
DESCRIPTION:The talk will concentrate on open questions related to the optimal bounds for the discrepancy of an $N$-point set in the $d$-dimensional unit cube. The so-called star-discrepancy measures the difference between the actual and expected number of points in axis-parallel rectangles\, and thus measures the equidistribution of the set. This notion has been explored by H. Weyl\, K. Roth\, and many others\, however many questions still remain open\, especially in higher dimensions.  We shall discuss the two main conjectures on the order of star-discrepancy and present evidence in support of each one\, as well as their connections to various areas of mathematics. In addition\, we shall talk about discrepancy in other geometrical settings (rotated rectangles\, balls\, points on the sphere etc).
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-dmitriy-bilyk-university-of-minnesota/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200226T161500
DTEND;TZID=America/Los_Angeles:20200226T171500
DTSTAMP:20260409T230250
CREATED:20190830T174358Z
LAST-MODIFIED:20200224T200806Z
UID:1440-1582733700-1582737300@colleges.claremont.edu
SUMMARY:Energy optimization on the sphere
DESCRIPTION:Many problems\, arising in discrete and metric geometry\, signal processing\, physics\, etc\, can be reformulated as questions of optimizing discrete or continuous measures. We shall review some of such conjectures\, as well as approaches to determining optimal (or at least good) point distributions and measures\, and connections to other problems\, such as discrepancy\, sphere packings etc. We shall also discuss several manifestations of the phenomenon of clustering of minimizing measures\, which is often observed theoretically\, numerically\, or experimentally: in many situations\, in particular for some attractive-repulsive potentials\, the minimizers of the energy integral happen to be discrete or supported on very thin sets.
URL:https://colleges.claremont.edu/ccms/event/dmitriy-bilyk/
LOCATION:Freeberg Forum\, LC 62\, Kravis Center\, CMC
CATEGORIES:Colloquium
ORGANIZER;CN="Blerta Shtylla":MAILTO:shtyllab@pomona.edu
END:VEVENT
END:VCALENDAR