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:20200128T150000
DTEND;TZID=America/Los_Angeles:20200128T160000
DTSTAMP:20260404T152519
CREATED:20191214T212832Z
LAST-MODIFIED:20200121T204015Z
UID:1695-1580223600-1580227200@colleges.claremont.edu
SUMMARY:Stefano Vidussi (UCRiverside)
DESCRIPTION:Title: The BNS invariant of the fundamental group of a surface bundle over a surface. \nAbstract: We will discuss some new results on the Bieri-Neumann-Strebel invariant of these groups\, showing in particular that (with obvious exceptions) they algebraically fiber. As a corollary\, we show that for “most” bundles these groups are not coherent.
URL:https://colleges.claremont.edu/ccms/event/stefano-vidussi-ucriverside/
CATEGORIES:Topology Seminar
ORGANIZER;CN="Helen Wong":MAILTO:hwong@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200129T161500
DTEND;TZID=America/Los_Angeles:20200129T171500
DTSTAMP:20260404T152519
CREATED:20190830T173951Z
LAST-MODIFIED:20200124T210246Z
UID:1432-1580314500-1580318100@colleges.claremont.edu
SUMMARY:A Tauberian theorem and some of its applications
DESCRIPTION:In general terms\, a Tauberian theorem deals with the relationship between the properties of one transform of a measure with those of another transform. We will introduce the notion of a Tauberian theorm\, and present our own recent theorem in this direction. Our theorem provides a uniform theory for the construction of certain localized kernels in a very general context. These in turn play a fundamental role in many different applications in numerical analysis\, signal processing\, and machine learning. We will discuss a few applications\, for example\, the construction of a theory inspired neural network for the solution of Burgers equation\, inversion of Laplace transform of point masses\, and an alternative theory for function approximation in the setting of diffusion geometry in machine learning without the need for any eigen-decomposition of a large matrix.
URL:https://colleges.claremont.edu/ccms/event/hrushikesh-mhaskar/
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:20200201T100000
DTEND;TZID=America/Los_Angeles:20200201T120000
DTSTAMP:20260404T152519
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:20260404T152519
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:20260404T152519
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/
CATEGORIES:Topology Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200205T161500
DTEND;TZID=America/Los_Angeles:20200205T171500
DTSTAMP:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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:20260404T152519
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
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200302T161500
DTEND;TZID=America/Los_Angeles:20200302T171500
DTSTAMP:20260404T152519
CREATED:20190910T224521Z
LAST-MODIFIED:20200220T193630Z
UID:1518-1583165700-1583169300@colleges.claremont.edu
SUMMARY:Applied Math Talk: Approaches to modeling dispersal and swarm behavior at multiple scales given by Prof. Christopher Strickland ( The University of Tennessee\, Knoxville)
DESCRIPTION:Biological invasions often have outsized consequences for the invaded ecosystem and represent an interesting challenge to model mathematically. Landscape heterogeneity\, non-local or time-dependent spreading mechanisms\, coarse data\, and air or water flow transport are but a few of the complications that can greatly affect our understanding of small organism movement – a critical component of both invasion success and the ability of native organisms to persist at a location. In this talk\, I will look at dispersal and swarm behavior from a multi-scale\, mathematical perspective in order to address some of these challenges. \nConsidering the problem of long-distance dispersal\, I will discuss a method for modeling invasive spread over large\, heterogeneous landscapes by interpreting the quantity of interest as the probability of species occurrence rather than population size. On large scales\, one can also take advantage of ecological niche modeling approaches in order to reduce the dimensionality of data quantifying landscape heterogeneity. I will then shift focus to the initial stages of an invasion and concentrate on the local- and meso-scale by considering the intentional release of a parasitoid wasp biocontrol agent. In this case\, we can utilize a Bayesian framework and maximum likelihood estimation to parameterize the model based on proxy time-series data collected in the field. Finally\, I will describe some of my current work close to the microscale examining the dynamics of organism movement and behavior with respect to a surrounding fluid environment.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-christina-edholm-scripps-college/
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:20200303T121500
DTEND;TZID=America/Los_Angeles:20200303T131000
DTSTAMP:20260404T152519
CREATED:20200203T174750Z
LAST-MODIFIED:20200227T042826Z
UID:1851-1583237700-1583241000@colleges.claremont.edu
SUMMARY:Graph coloring reconfiguration systems (Prateek Bhakta\, University of Richmond)
DESCRIPTION:For k >= 2\, the k-coloring graph C(G) of a base graph G has a vertex set consisting of the proper k-colorings of G with edges connecting two vertices corresponding to two different colorings of G if those two colorings differ in the color assigned to a single vertex of G. A base graph whose k-coloring graph is connected is called k-mixing; here it is possible to reconfigure a particular k-coloring of G to any other k-coloring of G by changing the color of one vertex at a time in the assignment while maintaining that each intermediate step is a proper k-coloring. We explore the connectivity and biconnectivity of coloring graphs with a focus on the inverse problem: given a graph H\, is H the k coloring graph of some base graph G for some k?
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-prateek-bhaktaw-university-of-richmond/
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:20200304T161500
DTEND;TZID=America/Los_Angeles:20200304T171500
DTSTAMP:20260404T152519
CREATED:20190830T194342Z
LAST-MODIFIED:20200227T181351Z
UID:1443-1583338500-1583342100@colleges.claremont.edu
SUMMARY:Christopher Strickland: Modeling the prescription opioid epidemic
DESCRIPTION:Opioid addiction has become a national health crisis in recent years\, with involvement in 66% of all drug overdose deaths in 2016 and high economic costs. In contrast to the dynamics of a classic disease or illicit drug epidemic\, opioid addiction has its roots in legal\, prescription medication – a fact which greatly increases the exposed population and mathematically suggests non-contact based routes of infection. \nIn this talk\, I will present a first epidemic model for opioid addiction and treatment. Through analysis of our model\, we show that existence of an addiction-free equilibrium requires transforming the opioid dynamics into that of a purely illicit drug epidemic and that lacking prescription-induced addiction\, the prescription drug epidemic may not be self-sustaining. Numerical analysis suggests specific targets for control. Following this\, I will present preliminary results from a new model that examines the role of heroin and fentanyl on the epidemic in the context of data from the state of Tennessee. These results include a strong fit between model and data\, and among other conclusions\, suggest that an epidemic involving powerful\, illicit opioids is now both self-sustaining and strongly on the rise despite a decline in prescription-based addictions. \n \n 
URL:https://colleges.claremont.edu/ccms/event/tba-17/
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:20200307T100000
DTEND;TZID=America/Los_Angeles:20200307T120000
DTSTAMP:20260404T152519
CREATED:20200218T012319Z
LAST-MODIFIED:20200218T012319Z
UID:1875-1583575200-1583582400@colleges.claremont.edu
SUMMARY:GEMS Workshop: The Mathematics of Reapportionment and Census Data with Professor Adolfo Rumbos of Pomona College
DESCRIPTION:TOPIC: The Mathematics of Reapportionment and Census Data \nEvery ten years\, the United States Census Bureau conducts a count of all persons living in the United States; one of those population counts will be carried out this year (2020). This Census is mandated by the US Constitution; it counts all people residing in the United States\, regardless of citizenship or immigration status. The data collected from the Census are used to make sure that everyone is equally represented in our political system and that government resources are allocated fairly. For instance\, Census counts are used to determine how many congressional seats a state receives. This is known as reapportionment. In this workshop we explore the Mathematics of reapportionment. If time permits\, we also explore how statistical sampling can be used to estimate population sizes. \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 March 7th worshop\, please click on the following link: \nhttps://docs.google.com/forms/d/e/1FAIpQLScDQukTH3LQvpAq_IYysKKol6O4i-ORptv7IbU9lRBWgzYmhA/viewform?usp=pp_url \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-the-mathematics-of-reapportionment-and-census-data-with-professor-adolfo-rumbos-of-pomona-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:20200309T161500
DTEND;TZID=America/Los_Angeles:20200309T171500
DTSTAMP:20260404T152519
CREATED:20191205T210642Z
LAST-MODIFIED:20200306T231655Z
UID:1684-1583770500-1583774100@colleges.claremont.edu
SUMMARY:(Cancelled!!) Applied Math Talk: Stable planar vegetation stripe patterns on sloped terrain in dryland ecosystems given by Prof. Paul Carter (University of Minnesota)
DESCRIPTION:In water-limited regions\, competition for water resources results in the formation of vegetation patterns; on sloped terrain\, one finds that the vegetation typically aligns in stripes or arcs. The dynamics of these patterns can be modeled by reaction-diffusion PDEs describing the interplay of vegetation and water resources\, where sloped terrain is modeled through advection terms representing the downhill flow of water. We focus on one such model in the ‘large-advection’ limit\, and we prove the existence of traveling planar stripe patterns using analytical and geometric techniques. We also discuss implications for the stability of the resulting patterns\, as well as the appearance of curved stripe solutions.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-paul-carter-university-of-minnesota/
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:20200310T121500
DTEND;TZID=America/Los_Angeles:20200310T131000
DTSTAMP:20260404T152519
CREATED:20200203T200943Z
LAST-MODIFIED:20200305T021333Z
UID:1856-1583842500-1583845800@colleges.claremont.edu
SUMMARY:Finding bases of new infinite dimensional representations of $\mathfrak{osp}(1|2n)$ ( Dwight Williams\, UT Arlington)
DESCRIPTION:The orthosymplectic Lie superalgebra $\mathfrak{osp}(1|2n)$ is rich in representation theory: while the finite dimensional $\mathfrak{osp}(1|2n)$-module category is semisimple\, the study of infinite dimensional representations of $\mathfrak{osp}(1|2n)$ is wide open. In this talk\, we will define the orthosymplectic Lie superalgebras\, realize $\mathfrak{osp}(1|2n)$ as differential operators on complex polynomials\, and describe the space of polynomials in commuting and anti-commuting variables as a representation space for $\mathfrak{osp}(1|2n)$. Moreover\, we will present operators—and perhaps generalized versions of these operators—which help give explicit bases for certain infinite dimensional $\mathfrak{osp}(1|2n)$-modules.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-dwight-williams-ut-arlington/
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:20200311T161500
DTEND;TZID=America/Los_Angeles:20200311T171500
DTSTAMP:20260404T152519
CREATED:20190830T194437Z
LAST-MODIFIED:20200309T185328Z
UID:1445-1583943300-1583946900@colleges.claremont.edu
SUMMARY:Edray Goins: Indiana Pols Forced to Eat Humble Pi\, The Curious History of an Irrational Number
DESCRIPTION:In 1897\, Indiana physician Edwin J. Goodwin believed he had discovered a way to square the circle\, and proposed a bill to Indiana Representative Taylor I. Record which would secure Indiana’s the claim to fame for his discovery. About the time the debate about the bill concluded\, Purdue University professor Clarence A. Waldo serendipitously came across the claimed discovery\, and pointed out its mathematical impossibility to the lawmakers. It had only be shown just 15 years before\, by the German mathematician Ferdinand von Lindemann\, that it was impossible to square the circle because π is an irrational number. This fodder became ignominiously known as the “Indiana Pi Bill” as Goodwin’s result would force $\pi = 3.2$. \nIn this talk\, we review this humorous history of the irrationality of $\pi$. We introduce a method to compute its digits\, present Lindemann’s proof of its irrationality (following a simplification by Miklo ́s Laczkovich)\, discuss the relationship with the Hermite-Lindemann-Weierstrass theorem\, and explain how Edwin J. Goodwin came to his erroneous conclusion in the first place.
URL:https://colleges.claremont.edu/ccms/event/tba-18/
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:20200324T121500
DTEND;TZID=America/Los_Angeles:20200324T131000
DTSTAMP:20260404T152519
CREATED:20200203T171430Z
LAST-MODIFIED:20200203T171430Z
UID:1849-1585052100-1585055400@colleges.claremont.edu
SUMMARY:ANTC talk by Asaf Ferber (UC Irvine)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-asaf-ferber-uc-irvine/
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:20200325T161500
DTEND;TZID=America/Los_Angeles:20200325T171500
DTSTAMP:20260404T152519
CREATED:20190830T194534Z
LAST-MODIFIED:20200219T181313Z
UID:1447-1585152900-1585156500@colleges.claremont.edu
SUMMARY:A competent translation/a pitiful bungle: The Foundations of Geometry (Jemma Lorenat)
DESCRIPTION:David Hilbert’s Grundlagen der Geometrie is a rare example of a historical mathematics text that is still profitably read today and continues to inspire research in mathematics\, computer science\, and philosophy. \nThe effort of publishing an English translation of Hilbert in 1902 involved a diverse swath of the American mathematical community.  Edgar Jerome Townsend completed a first draft of his authorized translation in a few weeks\, but the process of creating a successful publication involved negotiations\, corrections\, and attention to detail that continued well after the first edition appeared in print. Meanwhile\, published and private texts that circulated around the English edition contained conflicting conclusions with respect to the quality of the translation\, the book’s audience\, and the parameters of a scholarly critique. This talk sheds light on American mathematics at a pivotal time in its history and raises questions about the language and form of mathematical texts that continue to be relevant today.
URL:https://colleges.claremont.edu/ccms/event/tba-19/
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:20200331T150000
DTEND;TZID=America/Los_Angeles:20200331T160000
DTSTAMP:20260404T152519
CREATED:20200227T003039Z
LAST-MODIFIED:20200227T003039Z
UID:1906-1585666800-1585670400@colleges.claremont.edu
SUMMARY:Martin Bobb (UT Austin)
DESCRIPTION:TBA
URL:https://colleges.claremont.edu/ccms/event/martin-bobb-ut-austin/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Topology Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200401T161500
DTEND;TZID=America/Los_Angeles:20200401T171500
DTSTAMP:20260404T152519
CREATED:20200108T205641Z
LAST-MODIFIED:20200220T030820Z
UID:1705-1585757700-1585761300@colleges.claremont.edu
SUMMARY:Dagan Karp: Tropical Geometry and Moduli Spaces
DESCRIPTION:In this talk\, I’ll attempt to give an introduction to the beautiful world of tropical geometry. As an application\, I’ll describe work with Siddarth Kannan (Pomona 2018) and Shiyue Li (Mudd 2017) using tropical geometry to compute the cohomology of certain moduli spaces\, called heavy/light Hassett spaces\, which are of interest in a wide range of areas\, including the minimal model program and enumerative geometry.
URL:https://colleges.claremont.edu/ccms/event/dagan-karp/
LOCATION:Freeberg Forum\, LC 62\, Kravis Center\, CMC
ORGANIZER;CN="Blerta Shtylla":MAILTO:shtyllab@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200408T161500
DTEND;TZID=America/Los_Angeles:20200408T171500
DTSTAMP:20260404T152519
CREATED:20190830T194745Z
LAST-MODIFIED:20200129T015659Z
UID:1451-1586362500-1586366100@colleges.claremont.edu
SUMMARY:Satyan Devadoss: Unfolding Mathematics at Burning Man
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/tba-21/
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:20200413T161500
DTEND;TZID=America/Los_Angeles:20200413T171500
DTSTAMP:20260404T152519
CREATED:20200129T193002Z
LAST-MODIFIED:20200404T044359Z
UID:1841-1586794500-1586798100@colleges.claremont.edu
SUMMARY:Cancelled: Applied Math Talk given by Professor Mario Banuelos (Fresno State)
DESCRIPTION:TBA
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-professor-mario-banuelos-fresno-state/
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:20200414T080000
DTEND;TZID=America/Los_Angeles:20200414T170000
DTSTAMP:20260404T152519
CREATED:20200129T001127Z
LAST-MODIFIED:20200129T001128Z
UID:1825-1586851200-1586883600@colleges.claremont.edu
SUMMARY:ANTC talk by David Conlon (Cal Tech)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-david-conlon-cal-tech/
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
END:VCALENDAR