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:20170312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20171105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181127T121500
DTEND;TZID=America/Los_Angeles:20181127T131000
DTSTAMP:20260410T175105
CREATED:20181002T061007Z
LAST-MODIFIED:20190115T082646Z
UID:892-1543320900-1543324200@colleges.claremont.edu
SUMMARY:Weil sums of binomials: properties and applications (Daniel Katz\, CSUN)
DESCRIPTION:We consider sums in which an additive character of a finite field F is applied to a binomial whose individual terms (monomials) become permutations of F when regarded as functions.  These Weil sums characterize the nonlinearity of power permutations of interest in cryptography.  They also tell us about the correlation of linear recursive sequences over finite fields that are used in digital communications and remote sensing.  In these applications\, one is interested in the spectrum of Weil sum values that are obtained as the coefficients in the binomial are varied.  We discuss topics of enduring interest: Archimedean and non-Archimedean bounds on the sums\, the number of values in the spectrum\, and the presence or absence of zero in the spectrum.  We indicate some important open problems and discuss progress that has been made on them.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-talk-by-daniel-katz-csun/
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:20181128T161500
DTEND;TZID=America/Los_Angeles:20181128T171500
DTSTAMP:20260410T175105
CREATED:20180928T171407Z
LAST-MODIFIED:20181115T191108Z
UID:851-1543421700-1543425300@colleges.claremont.edu
SUMMARY:Convolutional Dictionary Learning for Tomographic Reconstruction (Cristina Garcia-Cardona\, LANL)
DESCRIPTION:Convolutional sparse representation is an efficient tool for computing sparse representations for entire signals in terms of sums of a set of convolutions with dictionary filters. Unlike representations that are based on overlapping image patches\, the convolutional representation optimizes over the entire image\, yielding representations that are very sparse both spatially and across the filters. This technique has been successfully applied to natural images\, video and speech in tasks as diverse as denoising\, classification or superresolution. In this work\, we develop a convolutional dictionary learning framework for tomographic reconstruction. We apply the technique to simulated parallel beam tomography data and show that its performance is comparable to the state-of-the-art reconstruction techniques.
URL:https://colleges.claremont.edu/ccms/event/cristina-garcia/
LOCATION:Argue Auditorium\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
GEO:34.0999157;-117.7142668
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Argue Auditorium Pomona College 610 N. College Ave. Claremont CA 91711 United States;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142668,34.0999157
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181201
DTEND;VALUE=DATE:20181202
DTSTAMP:20260410T175105
CREATED:20181103T190323Z
LAST-MODIFIED:20181103T190323Z
UID:939-1543622400-1543708799@colleges.claremont.edu
SUMMARY:Workshop on Nonlinear Analysis
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/workshop-on-nonlinear-analysis/
LOCATION:Shanahan\, concert hall
ORGANIZER;CN="Alfonso Castro":MAILTO:castro@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181203T161500
DTEND;TZID=America/Los_Angeles:20181203T171500
DTSTAMP:20260410T175105
CREATED:20180921T215624Z
LAST-MODIFIED:20181106T161858Z
UID:560-1543853700-1543857300@colleges.claremont.edu
SUMMARY:A Martingale Approach to the Question of Fiscal Stimulus (Michael Imerman\, CGU)
DESCRIPTION:Joint work with Larry Shepp & Philip Ernst \nIn this paper we develop a mathematical model to address an ongoing politico-economic debate between Democrats and Republicans. Democrats in the US say that government spending can be used to “grease the wheels’ of the economy\, create wealth\, and increase employment; the Republicans say that government spending is wasteful\, discourages investment\, and so increases unemployment. These arguments cannot both be correct\, but both arguments seem meritorious. We address this economic question of fiscal stimulus as a new optimal control problem extending the model of Radner-Shepp (1996). A unique solution is found using traditional martingale methods for stochastic optimization along with a numerical procedure to solve a non-homogeneous ODE as the root of an implicit function. Specifically\, we find that there exists an optimal strategy with interesting mathematical properties.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-given-by-prof-michael-imerman-cgu/
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:20181204T121500
DTEND;TZID=America/Los_Angeles:20181204T131000
DTSTAMP:20260410T175105
CREATED:20180817T150812Z
LAST-MODIFIED:20181116T225428Z
UID:441-1543925700-1543929000@colleges.claremont.edu
SUMMARY:Sperner's lemma: generalizations and applications (Oleg Musin\, UT Rio Grande Valley)
DESCRIPTION:The classical Sperner –  KKM (Knaster – Kuratowski – Mazurkiewicz) lemma has many applications  in combinatorics\, algorithms\, game theory and mathematical economics. In this talk we consider generalizations of this lemma as well as Gale’s colored KKM lemma and Shapley’s KKMS theorem. It is shown that spaces and covers can be much more general and the boundary KKM rules can be substituted by more weaker boundary assumptions. These generalizations of Sperner’s lemma rely on homotopy invariants of covers  that in fact are obstructions for extending a cover of a subspace A in X to a cover of  X.
URL:https://colleges.claremont.edu/ccms/event/tba-2/
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:20181205T161500
DTEND;TZID=America/Los_Angeles:20181205T171500
DTSTAMP:20260410T175105
CREATED:20180928T171556Z
LAST-MODIFIED:20181129T192838Z
UID:853-1544026500-1544030100@colleges.claremont.edu
SUMMARY:The kissing number and related problems (Oleg Musin\, University of Texas Rio Grande Valley)
DESCRIPTION:Abstract: \nThe kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion between Isaac Newton and David Gregory in 1694. In three dimensions the problem was finally solved only in 1953 by Schutte and van der Waerden. In this talk we are going to give an overview of this problem and to present our solution of a long-standing problem about the kissing number in four dimensions. We are also going to discuss Tammes’ problem and other optimal sphere packings problems.
URL:https://colleges.claremont.edu/ccms/event/oleg-musin-university-of-texas-rio-grande-valley/
LOCATION:Argue Auditorium\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
GEO:34.0999157;-117.7142668
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Argue Auditorium Pomona College 610 N. College Ave. Claremont CA 91711 United States;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142668,34.0999157
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181208T100000
DTEND;TZID=America/Los_Angeles:20181208T120000
DTSTAMP:20260410T175105
CREATED:20181002T040036Z
LAST-MODIFIED:20181113T061215Z
UID:888-1544263200-1544270400@colleges.claremont.edu
SUMMARY:GEMS Workshop: Exploring the fascinating world of prime numbers\, Part II with Professor  Adolfo Rumbos\, from Pomona College.
DESCRIPTION:TOPIC: Exploring the fascinating world of prime numbers\, Part II \nThe study of patterns in the sequence of prime numbers has fascinated mathematicians for centuries.  Are there formulas that generate prime numbers?  Are there patterns in the distribution of prime numbers and the distribution of gaps between consecutive primes?  In this series of two workshops\, beginning with the proof of the infinitude of the primes and modular arithmetic\, we explore some facts about prime numbers\, solve some puzzles related to primes\, and survey a few of the questions that are still unsolved. \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 \nFALL 2018 DATES: \nOctober 6\, 2018 \nNovember 3\, 2018 \nDecember 8\, 2018 \nREGISTRATION: \nTo register for our next event on December 8\, please click on the following link: \nhttps://tinyurl.com/GEMS2018Fall3 \nANY QUESTIONS: \nPlease contact our 2018-2019 GEMS coordinator\, Elsa Harris at Elsa.Harris@cgu.edu
URL:https://colleges.claremont.edu/ccms/event/gems-workshop-speaker-will-be-announced-soon-2/
LOCATION:Shanahan 1480\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:GEMS
ORGANIZER;CN="Elsa Harris":MAILTO:elsa.harris@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181210T161500
DTEND;TZID=America/Los_Angeles:20181210T171500
DTSTAMP:20260410T175105
CREATED:20180921T221142Z
LAST-MODIFIED:20181116T192815Z
UID:562-1544458500-1544462100@colleges.claremont.edu
SUMMARY:Transfinite $\zeta$-metrics (Zair Ibragimov\, CMC)
DESCRIPTION:I will discuss the concept of transfinite ζ-metrics. In some details I will discuss transfinite Apollonian metric in the settings of semi-metric spaces. I will discuss specific examples of domains where the transfinite Apollonian metric can be computed explicitly. This is a preliminary work.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-given-by-prof-ibragimov-zair-cmc/
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:20181211T121500
DTEND;TZID=America/Los_Angeles:20181211T131000
DTSTAMP:20260410T175105
CREATED:20181017T000951Z
LAST-MODIFIED:20181205T171813Z
UID:915-1544530500-1544533800@colleges.claremont.edu
SUMMARY:The Bateman—Horn conjecture II:  applications (Stephan Garcia\, Pomona)
DESCRIPTION:We begin with a review of the Bateman—Horn conjecture\, which sheds light on the intimate relationship between polynomials and prime numbers.  In this expository talk\, we survey a host of applications of the conjecture.  For example\, Landau’s conjecture\, the twin prime conjecture\, and the Green—Tao theorem are all consequences of the Bateman—Horn conjecture.  Moreover\, the conjecture also illuminates the mysterious patterns observed in the Ulam spiral.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-stephan-garcia-pomona/
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:20181212T161500
DTEND;TZID=America/Los_Angeles:20181212T171500
DTSTAMP:20260410T175105
CREATED:20180928T171648Z
LAST-MODIFIED:20181206T172649Z
UID:855-1544631300-1544634900@colleges.claremont.edu
SUMMARY:Defining Ada: On The Legacy of Augusta Ada Byron King Lovelace (Gizem Karaali\, Pomona College)
DESCRIPTION:Abstract: Augusta Ada\, Countess of Lovelace\, is today viewed as the rst person to recognize the\npower of algorithmic machines and a pioneer in computer programming. Her biographers have often\ndisagreed on her mathematical talents\, her mathematical contributions\, and her legacy. In this talk\nI explore the various approaches taken towards her\, focusing explicitly on how the men in her life\nhave been used to dene her. I conclude with some thoughts on Adas impact and legacy. problems.
URL:https://colleges.claremont.edu/ccms/event/gizem-karaali-pomona-college/
LOCATION:Argue Auditorium\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
GEO:34.0999157;-117.7142668
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Argue Auditorium Pomona College 610 N. College Ave. Claremont CA 91711 United States;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142668,34.0999157
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190122T121500
DTEND;TZID=America/Los_Angeles:20190122T131000
DTSTAMP:20260410T175105
CREATED:20190112T013635Z
LAST-MODIFIED:20190113T053629Z
UID:1045-1548159300-1548162600@colleges.claremont.edu
SUMMARY:Niebrzydowski tribrackets and algebras (Sam Nelson\, CMC)
DESCRIPTION:In this talk we will survey recent work on Niebzydowski Tribrackets and Niebrydowski Algebras\, algebraic structures related to region colorings the planar complements of knots and trivalent spatial graphs.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sam-nelson-cmc/
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:20190123T161500
DTEND;TZID=America/Los_Angeles:20190123T171500
DTSTAMP:20260410T175105
CREATED:20190115T082247Z
LAST-MODIFIED:20200114T161552Z
UID:1096-1548260100-1548263700@colleges.claremont.edu
SUMMARY:CCMS Field Committee Meeting
DESCRIPTION:The Field Committee Meeting is our chance to socialize with our colleagues and coordinate our course offerings for the coming academic year (2019-2020).\n\nPlease come to discuss course offerings and other synergistic items.\n\nRefreshments at 4:00\, meeting at 4:15.
URL:https://colleges.claremont.edu/ccms/event/ccms-field-committee-meeting/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium,Special Event
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190124T120000
DTEND;TZID=America/Los_Angeles:20190124T133000
DTSTAMP:20260410T175105
CREATED:20190113T145840Z
LAST-MODIFIED:20190115T051329Z
UID:1066-1548331200-1548336600@colleges.claremont.edu
SUMMARY:Simplicial Complexes\, Configuration Spaces\, and "Chromatic" Invariants (Andrew Cooper\, NC State)
DESCRIPTION:Given a space $X$\, the configuration space $F(X\,n)$ is the space of possible ways to place $n$ points on $X$\, so that no two occupy the same position. But what if we allow some of the points to coincide? \nThe natural way to encode the allowed coincidences is as a simplicial complex $S$. I will describe how the configuration space $M(S\,X)$ obtained in this way gives rise to polynomial and homological invariants of $S$\, how those invariants are related to the cohomology ring $H^*(X)$\, and what this has to do with the topology of spaces of maps into $X$. \nI will also mention some potential applications of this structure to problems arising from international relations and economics. \nThis is joint work with Vin de Silva\, Radmila Sazdanovic\, and Robert J Carroll
URL:https://colleges.claremont.edu/ccms/event/topology-seminar-1-24-2019-andrew-cooper-nc-state/
LOCATION:Roberts North 104\, CMC\, 320 E. 9th St.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190126T093000
DTEND;TZID=America/Los_Angeles:20190126T173000
DTSTAMP:20260410T175105
CREATED:20190123T055731Z
LAST-MODIFIED:20190123T224907Z
UID:1131-1548495000-1548523800@colleges.claremont.edu
SUMMARY:Claremont Math Weekend 2019
DESCRIPTION:On Saturday January 26th\, Claremont Math Faculty will present 30 minute talks on their research. The goal of these presentations is to expose students\, both graduate and undergraduate\, to various areas of mathematics and applications that Claremont mathematicians are researching.  Faculty presenters will provide Claremont Colleges course titles and descriptions that are related to their research topics at the end of their talks. \nBreakfast\, lunch\, and refreshments will be provided. \nPlease use free registration link:\nhttps://www.eventbrite.com/e/claremont-math-weekend-2019-tickets-55086326686 \n  \nProgram:\n    9:30 – 10:00  Registration\, Breakfast\n   10:00 – 10:10  Marina Chugunova\, “What is CCMS?  Opening remarks”\n   10:10 – 10:40  Asuman Aksoy\, “A characterization of compact linear mapping”\n   10:40 – 11:10  Yesim Demiroglu\, “Cayley digraphs of matrix rings over finite fields”\n   11:10 – 11:25  Coffee break\n   11:25 – 11:55  Adolfo Rumbos\, “Applications of critical point theory to the theory of differential equations”\n   11:55 – 12:25  Jeho Park\, “The New Quantitative and Computing Lab: connecting dots through mentoring\, training\, and consulting”\n   12:25 – 2:00   Lunch\n   2:00  – 2:30   Ami Radunskaya\, “Does noise help or hurt?”\n   2:30 –  3:00   Alfonso Castro\, “Infinitely many radial solutions for a super-cubic Kirchhoff equation”\n   3:00  – 3:15   Coffee break\n   3:15  – 3:45   Chiu-Yen Kao\, “Frequency control of rods and plates”\n   3:45  – 4:15   Qidi Peng\, “Graph coloring and distributed mode selection for FDD communication in multihop wireless networks”\n   4:15  – 4:45   Lenny Fukshansky\, “An algebraic approach to integer sparse recovery”\n   4:45  – 5:30   Wine and Cheese
URL:https://colleges.claremont.edu/ccms/event/claremont-math-weekend-2019/
LOCATION:Pryne Auditorium\, Galileo Hall\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Claremont Math Weekend
ORGANIZER;CN="Marina Chugunova":MAILTO:Marina.Chugunova@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190128T161500
DTEND;TZID=America/Los_Angeles:20190128T171500
DTSTAMP:20260410T175105
CREATED:20190109T192745Z
LAST-MODIFIED:20190117T020332Z
UID:996-1548692100-1548695700@colleges.claremont.edu
SUMMARY:Applied Math Seminar Organizational Meeting
DESCRIPTION:We will have an organizational meeting for the applied math seminar at 4:15pm in Emmy Noether Rm\, Millikan 1021\, Pomona on 1/28  (Monday). Anyone who in interested in suggesting speakers and/or organizing applied math seminar is welcome to come. 
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-organizational-meeting/
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:20190129T121500
DTEND;TZID=America/Los_Angeles:20190129T131000
DTSTAMP:20260410T175105
CREATED:20181130T222530Z
LAST-MODIFIED:20181130T222530Z
UID:961-1548764100-1548767400@colleges.claremont.edu
SUMMARY:Discrete compressed sensing: lattices and frames (Josiah Park\, Georgia Tech)
DESCRIPTION:Lattice valued vector systems have taken an important role in packing\, coding\, cryptography\, and signal processing problems.  In compressed sensing\, improvements in sparse recovery methods can be reached with an additional  assumption that the signal of  interest is lattice  valued\, as demonstrated by A.  Flinth  and G. Kutyniok. Equiangular  tight  frames are  particular systems  of unit  vectors  with minimal  coherence\,  a measure of how well distributed the vectors are\, and have provable guarantees for recovery of sparse vectors in standard methods.  The determination whether real equiangular tight frames have integer span on a lattice has been given a characterization within two papers by A. Bottcher\, L. Fukshansky\, one with S. R. Garcia\, H. Maharaj and D. Needell.  Here the corresponding question is considered for the complex case and several families are demonstrated to have either integer span on a lattice or not.  In addition\, it is demonstrated that a real Parseval tight frame can have integer span on a lattice if and only if the inner products appearing in the system are rational.  (Collaboration with L. Fukshansky\, D. Needell\, and Y. Xin)
URL:https://colleges.claremont.edu/ccms/event/discrete-compressed-sensing-lattices-and-frames-josiah-park-georgia-tech/
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:20190130T161500
DTEND;TZID=America/Los_Angeles:20190130T171500
DTSTAMP:20260410T175105
CREATED:20190110T154412Z
LAST-MODIFIED:20190123T163658Z
UID:1000-1548864900-1548868500@colleges.claremont.edu
SUMMARY:Mathematics: Pure\, Applied\, A Liberal Art ( Al Erisman\, Seattle Pacific University)
DESCRIPTION:From the view of a pure mathematician\, those working in pure mathematics produce pure knowledge. Whether used or not\, it has a great elegance and value in and of itself. Those in applied mathematics simply pick up what has been done and use it in designing or building things. Number theory is often used to illustrate this\, where work done decades ago in pure mathematics is now central to encryption. \nHowever\, the relationship between pure and applied mathematics is a bit more complicated. New insights drawn from applications have been at the root of interesting new areas and questions in pure mathematics. Fourier analysis\, sparse matrix computation\, and graph theory all demonstrate this. \nSome have argued that\, whether pure or applied\, mathematics is not really needed by the average person. Alfred North Whitehead\, a Harvard mathematician and philosopher\, once stated\, “ideas [from mathematics] are of highly specialized application\, and rarely influence thought.” In other words\, mathematics is a specialized skill\, but not a liberal art. \nUsing examples from n-dimensional linear algebra\, I will show why I believe the areas of pure and applied mathematics are deeply tied\, and that this field does indeed influence thought in areas like understanding relationships and political discourse.
URL:https://colleges.claremont.edu/ccms/event/mathematics-pure-applied-a-liberal-art-al-erisman-seattle-pacific-university/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190131T123000
DTEND;TZID=America/Los_Angeles:20190131T133000
DTSTAMP:20260410T175105
CREATED:20190127T185244Z
LAST-MODIFIED:20190127T185524Z
UID:1168-1548937800-1548941400@colleges.claremont.edu
SUMMARY:The Roger-Yang Arc Algebra (Helen Wong\, CMC)
DESCRIPTION:  \nBased on geometric considerations\, J. Roger and T. Yang in 2014 defined a version of the Kauffman bracket skein algebra for punctured surfaces that includes arcs going from puncture to puncture. We’ll provide a brief survey of known results about this arc algebra. In particular\, I’d like to mention a recent algebraic result whose proof uses  “generalized” corner coordinates to describe arcs on a triangulated surface. This is joint work with Han-bom Moon. \n 
URL:https://colleges.claremont.edu/ccms/event/the-roger-yang-arc-algebra/
LOCATION:Roberts North 104\, CMC\, 320 E. 9th St.\, 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:20190202T100000
DTEND;TZID=America/Los_Angeles:20190202T120000
DTSTAMP:20260410T175105
CREATED:20190115T195645Z
LAST-MODIFIED:20190115T195645Z
UID:1104-1549101600-1549108800@colleges.claremont.edu
SUMMARY:GEMS Workshop: Graph Theory\, Part I with Professor Michael Orrison\, from Harvey Mudd College
DESCRIPTION:TOPIC: Graph Theory\, Part I \nOn the surface\, graphs seem to be some of the simplest objects you might encounter in mathematics. After all\, they are made up of just two kinds of parts\, vertices and edges\, and those parts fit together in simple ways. But appearances can be deceiving! In this series of two workshops\, we’ll explore several surprising facts about graphs. Along the way\, we’ll see how graphs arise in a variety of settings\, and how they give rise to many challenging but worthwhile problems. \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 2019 DATES: \nFebruary 2\, 2019 \nMarch 2\, 2019 \nApril 13\, 2019 \nREGISTRATION: \nTo register for our next event on February 2\, please click on the following link: \nhttps://tinyurl.com/GEMS2019Spring1 \nANY QUESTIONS: \nPlease contact our 2018-2019 GEMS coordinator\, Elsa Harris at Elsa.Harris@cgu.edu
URL:https://colleges.claremont.edu/ccms/event/gems-workshop-graph-theory-part-i-with-professor-michael-orrison-from-harvey-mudd-college/
LOCATION:Shanahan 1480\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:GEMS
ORGANIZER;CN="Elsa Harris":MAILTO:elsa.harris@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190204T161500
DTEND;TZID=America/Los_Angeles:20190204T171500
DTSTAMP:20260410T175105
CREATED:20181008T181051Z
LAST-MODIFIED:20190117T015941Z
UID:895-1549296900-1549300500@colleges.claremont.edu
SUMMARY:Estimating the physical location of Twitter users with the von Mises-Fisher distribution (Mike Izbicki\, UC Riverside)
DESCRIPTION:Approximately 500 million tweets are sent everyday.  Scientists monitor these tweets to predict the spread of disease\, better allocate social welfare services\, help first responders during natural disasters\, and many other important tasks.  A key step in each of these tasks is estimating the location the tweet was sent from.  In\nthis talk\, I discuss how to combine machine learning and the von Mises-Fisher distribution to estimate this location.  The von Mises-Fisher distribution is the spherical analog of the Gaussian distribution\, and this distribution lets us exploit the earth’s non-Euclidean geometry to improve estimation accuracy.
URL:https://colleges.claremont.edu/ccms/event/tba-mike-izbicki-uc-riverside/
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:20190205T121500
DTEND;TZID=America/Los_Angeles:20190205T131000
DTSTAMP:20260410T175105
CREATED:20181205T171033Z
LAST-MODIFIED:20190123T223504Z
UID:963-1549368900-1549372200@colleges.claremont.edu
SUMMARY:Lattices from group frames and vertex transitive graphs (Lenny Fukshansky\, CMC)
DESCRIPTION:Tight frames in Euclidean spaces are widely used convenient generalizations of orthonormal bases. A particularly nice class of such frames is generated as orbits under irreducible actions of finite groups of orthogonal matrices: these are called irreducible group frames. Integer spans of rational irreducible group frames form Euclidean lattices with some very nice geometric properties\, called strongly eutactic lattices. We discuss this construction\, focusing on an especially interesting infinite family in arbitrarily large dimensions\, which comes from vertex transitive graphs. We demonstrate several examples of such lattices from graphs that exhibit some rather fascinating properties. This is joint work with D. Needell\, J. Park and J. Xin.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-lenny-fukshansky-cmc/
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:20190206T161500
DTEND;TZID=America/Los_Angeles:20190206T171500
DTSTAMP:20260410T175105
CREATED:20190110T154612Z
LAST-MODIFIED:20190214T061816Z
UID:1002-1549469700-1549473300@colleges.claremont.edu
SUMMARY:Algebraic and Polyhedral Perspectives on Combinatorial Neural Codes (Robert Davis\, Harvey Mudd)
DESCRIPTION:In the 1970s\, James O’Keefe and his team observed that certain neurons in the brain\, called place cells\, spike in their firing rates when the animal is in a particular physical location within its arena. If a place cell is thought of as either “active” or “silent\,” then one may represent the co-firing patterns of place cells by a combinatorial neural code: a set of 0/1 vectors whose coordinates represent that status of distinct place cells. From the code\, we can try to reconstruct a geometric picture of the neural activity by sketching a disjoint union of simple closed curves in the plane. Ideally\, each curve corresponds to a unique place cell and the interiors of the curves are convex. However\, this is not always possible\, and identifying criteria which makes this possible is a difficult problem. \nIn this talk\, we will discuss approaches to the problem of representing combinatorial neural codes using convex sets. We will see how turning the codewords into polynomials can reveal hidden information about the code\, and how this naturally leads to examining properties of related polyhedra. In particular\, we will present progress on using polyhedra to identify representability of a code with circles in the plane.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-robert-davis-harvey-mudd/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190211T041500
DTEND;TZID=America/Los_Angeles:20190211T171500
DTSTAMP:20260410T175105
CREATED:20190129T225920Z
LAST-MODIFIED:20190214T062202Z
UID:1184-1549858500-1549905300@colleges.claremont.edu
SUMMARY:Community structure in networks: the effect of communities on a preferential attachment model and epidemic spreading (Emily Fischer\, Cornell)
DESCRIPTION:Online social networks and other networks of interest are known to exhibit community structure\, where a community is defined to be a highly interconnected group of nodes with possibly shared traits or features. However\, classic network models\, such as the preferential attachment model\, do not account for community structure. In this talk\, I will present the Community-Aware Preferential Attachment Model (CAPAM)\, which allows the user to specify community structure via edge probabilities. I will show that CAPAM retains desirable properties of the preferential attachment model\, namely a power-law degree distribution\, and further that the multivariate degree distribution is dependent upon the edge probabilities in an interesting way. I will show that community structure also plays a role in epidemic spreading processes. Under the SIS model\, the lifetime of a spreading process is constrained by the structure of the individual communities\, and the epidemic threshold is bounded closely around the threshold associated with the strongest community.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-emily-fisher/
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:20190212T121500
DTEND;TZID=America/Los_Angeles:20190212T131000
DTSTAMP:20260410T175105
CREATED:20181227T132155Z
LAST-MODIFIED:20190120T184543Z
UID:994-1549973700-1549977000@colleges.claremont.edu
SUMMARY:Subgraph statistics (Benny Sudakov\, ETH Zurich)
DESCRIPTION:Given integers $k\,l$  and a graph $G$\, how large can be the fraction of $k$-vertex subsets of $G$ which span exactly $l$ edges?  The systematic study of this very natural  question  was recently initiated by Alon\, Hefetz\, Krivelevich and Tyomkyn who also proposed several interesting conjectures on this topic. \n\nIn this talk we discuss a theorem which proves one of their conjectures and implies an asymptotic version of another.  We also make some first steps towards analogous question for hypergraphs. Our proofs involve some Ramsey-type arguments\, and a number of different probabilistic tools\, such as polynomial anticoncentration inequalities and  hypercontractivity. \nJoint work with M. Kwan and T. Tran.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-benny-sudakov-eth-zurich/
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:20190213T161500
DTEND;TZID=America/Los_Angeles:20190213T171500
DTSTAMP:20260410T175105
CREATED:20190110T154812Z
LAST-MODIFIED:20190213T234043Z
UID:1004-1550074500-1550078100@colleges.claremont.edu
SUMMARY:Cracking the Code: Predicting Properties of Material Fracture Networks using Machine Learning (Allon Percus\, CGU)
DESCRIPTION:Understanding how fluid flows through heterogeneous materials\, and how it can make these materials fail\, are among the hardest challenges in materials science.  Experiments and simulations show that flow through subsurface rock is mostly limited to a small subnetwork\, or backbone\, of fractures.  Identifying this backbone would allow for a large speedup in flow and transport simulations\, but the process of identifying it can itself be computationally intensive.  I will discuss a machine learning approach\, developed in a CGU Math Clinic project with Los Alamos National Laboratory\, that rapidly finds relevant subnetworks based on graph structure and training data from simulations.  Time permitting\, I will also describe a method that uses graph convolutional neural networks to predict\, with high accuracy\, how fractures grow in brittle materials.  This provides an automated approach for learning how the fractures can radiate through the material\, and ultimately cause it to fail.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-allon-percus-cgu/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190218T160000
DTEND;TZID=America/Los_Angeles:20190218T170000
DTSTAMP:20260410T175105
CREATED:20190214T233621Z
LAST-MODIFIED:20190214T233621Z
UID:1213-1550505600-1550509200@colleges.claremont.edu
SUMMARY:Job Talk - Nicole Fider\, UC Irvine
DESCRIPTION:Candidate for Assistant Professor in Mathematics\, Scripps College \nA surprising application of mathematics:  How to name a color \nYour brain likes patterns and categories; by grouping related ideas together\, it can store and recall information quickly.  Real-life continuous domains (like time and taste) are inherently composed of infinitely many points of information\, which your brain segments into finitely many categories for convenience (such as morning/afternoon/evening/night\, or sweet/sour/salty/bitter).  This phenomenon is well-documented and is a topic of interest in the behavioral\, cognitive\, and social sciences. \nThe set of colors is another example of a continuous domain\, which in English is segmented into categories called “blue\,” “red\,” “green\,” etc.  In this talk\, I discuss how we apply mathematics —including calculus and linear algebra—to real-world data to study the occurrence of different categorizations schemes of the color space.  I then outline several related open projects. \n  \nMonday\, February 18 \n4:00-4:50pm \nBalch 218 \nScripps College \n  \nFMI contact: ctowse@scrippscollege.edu \n 
URL:https://colleges.claremont.edu/ccms/event/job-talk-nicole-fider-uc-irvine/
LOCATION:CA
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190219T121500
DTEND;TZID=America/Los_Angeles:20190219T131000
DTSTAMP:20260410T175105
CREATED:20190123T071222Z
LAST-MODIFIED:20190203T022044Z
UID:1141-1550578500-1550581800@colleges.claremont.edu
SUMMARY:Knowledge\, strategies\, and know-how (Pavel Naumov\, CMC)
DESCRIPTION:An agent comes to a fork in a road. There is a sign that says that one of the two roads leads to prosperity and another to death. The agent must take the fork\, but she does not know which road leads where. Does the agent have a strategy to get to prosperity? On one hand\, since one of the roads leads to prosperity\, such a strategy clearly exists. On the other\, the agent does not know what the strategy is. \nIf a coalition of agents has a strategy\, it knows that it has a strategy\, and it also knows what this strategy is\, then we say that the coalition has a know-how strategy. In this talk I will discuss several of my recent papers on modal logics that describe the interplay between coalition knowledge\, strategies\, and know-how strategies.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-pavel-naumov-cmc/
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:20190220T161500
DTEND;TZID=America/Los_Angeles:20190220T171500
DTSTAMP:20260410T175105
CREATED:20190110T154953Z
LAST-MODIFIED:20190214T061909Z
UID:1006-1550679300-1550682900@colleges.claremont.edu
SUMMARY:Personal Perspectives on m-ary Partitions (James Sellers\, Penn State)
DESCRIPTION:Abstract:  A great deal of my research journey has involved the study of m-ary partitions.  These are integer partitions wherein each part must be a power of a fixed integer m > 1.  Beginning in the late 1960s\, numerous mathematicians (including Churchhouse\, Andrews\, Gupta\, and Rodseth) studied divisibility properties of m-ary partitions.  In this talk\, I will discuss work I completed with Rodseth which generalizes the results of Andrews and Gupta from the 1970s.  Time permitting\, I will then discuss several problems related to m-ary partitions\, including my work with Neil Sloane on non-squashing stacks of boxes\, an application of m-ary partitions to objects known as “unique path partitions” (which are motivated from representation theory of the symmetric group)\, as well as very recent work with George Andrews and Aviezri Fraenkel on the characterization of the number of m-ary partitions of n modulo m.  Throughout the talk\, I will attempt to highlight various aspects of the research related to symbolic computation.  The talk will be self-contained and geared for a general mathematical audience.
URL:https://colleges.claremont.edu/ccms/event/personal-perspectives-on-m-ary-partitions-james-sellers-penn-state/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190221T120000
DTEND;TZID=America/Los_Angeles:20190221T133000
DTSTAMP:20260410T175105
CREATED:20190123T234443Z
LAST-MODIFIED:20190123T234443Z
UID:1163-1550750400-1550755800@colleges.claremont.edu
SUMMARY:A nonorientable version of the Milnor Conjecture (Cornelia A. Van Cott\, USF)
DESCRIPTION:In 1968\, Milnor famously conjectured that the smooth 4-genus of the torus knot T(p\,q) is given by (p-1)(q-1)/2. This conjecture was first verified by Kronheimer and Mrowka in 1993 and has received several other proofs since then. In this talk\, we discuss a nonorientable analogue of this conjecture\, first formulated by Josh Batson. We prove the conjecture for infinite families of of torus knots\, using tools from knot Floer homology. We also connect the problem to the world of continued fractions\, which gives an alternative perspective on the problem. This is joint work with Stanislav Jabuka.
URL:https://colleges.claremont.edu/ccms/event/a-nonorientable-version-of-the-milnor-conjecture-cornelia-a-van-cott-usf/
LOCATION:Roberts North 104\, CMC\, 320 E. 9th St.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Topology Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190222T160000
DTEND;TZID=America/Los_Angeles:20190222T173000
DTSTAMP:20260410T175105
CREATED:20190219T055204Z
LAST-MODIFIED:20190513T052208Z
UID:1221-1550851200-1550856600@colleges.claremont.edu
SUMMARY:Uniform Convergence: A One-Woman Play
DESCRIPTION:Uniform Convergence is a one-woman play\, written and performed by mathematics graduate student Corrine Yap. It juxtaposes the stories of two women trying to find their place in a white male-dominated academic world. The first is of historical Russian mathematician Sofia Kovalevskaya\, who was lauded as a pioneer for women in science but only after years of struggle for recognition. Her life’s journey is told through music and movement\, in both Russian and English. The second is of a fictional Asian-American woman\, known only as “Professor”\, trying to cope with the prejudice she faces in the present. As she teaches an introductory real analysis class\, she uses mathematical concepts to draw parallels to the race and gender conflicts she encounters in society today. \nSee https://www.corrineyap.com/uniformconvergence/ for more information about the play.
URL:https://colleges.claremont.edu/ccms/event/uniform-convergence-a-one-woman-play/
LOCATION:Millikan 1051\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Special Event
END:VEVENT
END:VCALENDAR