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:20200127T161500
DTEND;TZID=America/Los_Angeles:20200127T171500
DTSTAMP:20260420T122359
CREATED:20191021T210941Z
LAST-MODIFIED:20200120T080056Z
UID:1616-1580141700-1580145300@colleges.claremont.edu
SUMMARY:Applied Math Talk:  Statistical Mechanics of Molecular Evolution and its Role in the SELEX Protocol given by Prof. Bhaven Mistry (CMC)
DESCRIPTION:Antibodies are the standard biomolecule for marking molecular structures and delivering drugs due to their specific binding capabilities. However\, they are expensive to produce and their relatively large size prevents their easy traversal of bi-lipid membranes. Over the past 30 years\, molecular recognition has also been achieved through the use of aptamers\, short oligonucleotide sequences that fold in conformations that allow them to specifically bind to targets. These aptamers are produced rapidly and efficiently through a process known as Systematic Evolution of Ligands by EXponential enrichment (SELEX) whereby a molecular selection mechanism based on competitive binding enriches the population of given strands and removes unwanted sequences\, yielding high target specificity and affinity. Current SELEX mathematical models are formulated in the mass action limit\, which assumes large aptamer/target concentrations. Low number effects\, such as the extinction probability of the best binding aptamer\, however\, require a full stochastic model currently lacking in the literature. We derive such a statistical mechanics model verifying that in the large aptamer/target concentration limit\, the mass action results are recovered. Our stochastic model also allows us to calculate the extinction probability and efficiency of selection\, and to propose a method of optimizing the SELEX protocol.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-bhaven-mistry-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:20200128T121500
DTEND;TZID=America/Los_Angeles:20200128T131000
DTSTAMP:20260420T122359
CREATED:20200124T175017Z
LAST-MODIFIED:20200124T232945Z
UID:1791-1580213700-1580217000@colleges.claremont.edu
SUMMARY:Castelnuovo-Mumford regularity of edge ideals of graphs (Siamak Yassemi\, University of Tehran)
DESCRIPTION:Let K be a field and S = K[x_1\,…\,x_n] be the polynomial ring in n variables over K. For a graded S-module M with minimal free resolution the Castelnuovo-Mumford regularity  is defined. We survey a number of recent studies of the Castelnuovo-Mumford regularity of the ideals related to a graph and their (symbolic) powers. Our focus is on the bounds and exact values for the regularity in terms of combinatorial data from associated graphs. This research program has produced many exciting results and\, at the same time\, opened many further interesting questions and conjectures.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-siamak-yassemi-university-of-tehran/
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:20200128T150000
DTEND;TZID=America/Los_Angeles:20200128T160000
DTSTAMP:20260420T122359
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:20260420T122359
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:20260420T122359
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
END:VCALENDAR