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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181002T121500
DTEND;TZID=America/Los_Angeles:20181002T131000
DTSTAMP:20260407T043004
CREATED:20180911T213738Z
LAST-MODIFIED:20180926T151643Z
UID:533-1538482500-1538485800@colleges.claremont.edu
SUMMARY:An Introduction to the Sato-Tate Conjecture (Edray Goins\, Pomona College)
DESCRIPTION:In 1846\, Ernst Eduard Kummer conjectured a distribution of values of a cubic Gauss sum after computing a few values by hand.  This was forgotten about for nearly 100 years until John von Neumann and Herman Goldstine attempted to verify the conjecture as a way to test the new ENIAC machine in 1953.  They found evidence that the conjecture was false\, but trusted Kummer more than they did their digital computer.  The conjecture would hold until 1979\, when Roger Heath-Brown and Samuel Patterson proved it to be false. \nA few years earlier in 1965\, Mikio Sato and John Tate independently came up with a conjecture which gave the correct distribution of these cubic Gauss sums — although it was expressed slightly differently in terms of counting points of elliptic curves over finite fields.  In this talk\, we give an overview of the Sato-Tate Conjecture\, present an approach by Jean-Pierre Serre following his paper from 1967\, then sketch the 2006 proof of the conjecture following the ideas of Laurent Clozel\, Michael Harris\, Nicholas Shepherd-Barron and Richard Taylor. \nHere are the slides of this lecture: Edray Goins’ slides.
URL:https://colleges.claremont.edu/ccms/event/talk-by-edray-goins-pomona-college/
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:20181003T161500
DTEND;TZID=America/Los_Angeles:20181003T171500
DTSTAMP:20260407T043004
CREATED:20180928T164701Z
LAST-MODIFIED:20180928T164701Z
UID:834-1538583300-1538586900@colleges.claremont.edu
SUMMARY:Modeling Mechanisms of Ovulatory (Dys)Function (Erica Graham\, Bryn Mawr College)
DESCRIPTION:A normally functioning menstrual cycle requires significant crosstalk between hormones originating in ovarian and brain tissues. Reproductive hormone dysregulation may disrupt function and can lead to infertility\, as occurs in the common endocrine disorder polycystic ovarian syndrome (PCOS). In this talk\, I will discuss a mathematical model of the ovulatory cycle that accounts for mechanisms of ovarian testosterone production and explore insulin-mediated ovulatory dysfunction.  I will also explore additional model characteristics\, via bifurcations and parameter sensitivity\, and their respective clinical implications.
URL:https://colleges.claremont.edu/ccms/event/modeling-mechanisms-of-ovulatory-dysfunction-erica-graham-bryn-mawr-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:20181006T100000
DTEND;TZID=America/Los_Angeles:20181006T120000
DTSTAMP:20260407T043004
CREATED:20180925T191047Z
LAST-MODIFIED:20180926T051652Z
UID:653-1538820000-1538827200@colleges.claremont.edu
SUMMARY:GEMS Workshop: Knots and how to tell them apart (Professor Sam Nelson\, Claremont McKenna College)
DESCRIPTION:WHAT 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 first event on October 6\, 2018 please click on the following link: \nhttps://tinyurl.com/GEMS2018Fall \nANY QUESTIONS:  \nPlease contact our 2018-2019 GEMS coordinator\, Elsa Harris at Elsa.Harris@cgu.edu
URL:https://colleges.claremont.edu/ccms/event/fall-2018-gems-workshop-series/
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:20181009T121500
DTEND;TZID=America/Los_Angeles:20181009T131000
DTSTAMP:20260407T043004
CREATED:20180912T160739Z
LAST-MODIFIED:20181001T220127Z
UID:546-1539087300-1539090600@colleges.claremont.edu
SUMMARY:State Polytopes of Combinatorial Neural Codes (Rob Davis\, HMC)
DESCRIPTION:Combinatorial neural codes are 0/1 vectors that are used to model the co-firing patterns of a set of place cells in the brain. One wide-open problem in this area is to determine when a given code can be algorithmically drawn in the plane as a Venn diagram-like figure. A sufficient condition to do so is for the code to have a property called k-inductively pierced. Gross\, Obatake\, and Youngs recently used toric algebra to show that a code on three neurons is 1-inductively pierced if and only if the toric ideal is trivial or generated by quadratics. No result is known for additional neurons in the same generality. \nIn this talk\, we study two infinite classes of combinatorial neural codes in detail. For each code\, we explicitly compute its universal Gröbner basis. This is done for the first class by recognizing that the codewords form a Lawrence-type matrix. With the second class\, this is done by showing that the matrix is totally unimodular. These computations allow one to compute the state polytopes of the corresponding toric ideals\, from which all distinct initial ideals may be computed efficiently. Moreover\, we show that the state polytopes are combinatorially equivalent to well-known polytopes: the permutohedron and the stellohedron.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-rob-davis-hmc/
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:20181010T041500
DTEND;TZID=America/Los_Angeles:20181010T171500
DTSTAMP:20260407T043004
CREATED:20180928T170449Z
LAST-MODIFIED:20181005T213928Z
UID:838-1539144900-1539191700@colleges.claremont.edu
SUMMARY:Applications of Cayley Digraphs to Waring's Problem and Sum-Product Formulas (Yesim Demiroglu\, Harvey Mudd)
DESCRIPTION:Abstract: In this talk\, we first present some elementary new proofs (using Cayley digraphs and spectral graph theory) for Waring’s problem over finite fields\, and explain how in the process of re-proving these results\, we obtain an original result that provides an analogue of Sarkozy’s theorem in the finite field setting (showing that any subset E of a finite field Fq for which |E| >  (qk)/sqrt{q – 1}must contain at least two distinct elements whose difference is a kth power). Once we have our results for finite fields\, we apply some classical mathematics to extend our Waring’s problem results to the context of general (not  necessarily commutative) finite rings. In the second half of our talk\, we present our sum-product results related to matrix rings over finite fields\, which can again be proven using Cayley digraphs and spectral graph theory in an efficient way.
URL:https://colleges.claremont.edu/ccms/event/yesim-demiroglu-harvey-mudd/
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:20181015T161500
DTEND;TZID=America/Los_Angeles:20181015T171500
DTSTAMP:20260407T043004
CREATED:20180911T004755Z
LAST-MODIFIED:20180927T002145Z
UID:525-1539620100-1539623700@colleges.claremont.edu
SUMMARY:Agent-Based and Continuous Models of Locust Hopper Bands: The Role of Intermittent Motion\, Alignment\, Attraction and Repulsion (Andrew J. Bernoff\, HMC)
DESCRIPTION:Locust swarms pose a major threat to agriculture\, notably in northern Africa and the Middle East. In the early stages of aggregation\, locusts form hopper bands. These are coordinated groups that march in columnar structures that are often kilometers long and may contain millions of individuals. We propose a model for the formation of locust hopper bands that incorporates intermittent motion\, alignment with neighbors\, and social attraction\, all behaviors that have been validated in experiments. Using a particle-in-cell computational method\, we simulate swarms of up to a million individuals\, which is several orders of magnitude larger than what has previously appeared in the locust modeling literature. We observe hopper bands in this model forming as a fingering instability. Our model also allows homogenization to yield a system of partial integro-differential evolution equations. We identify a bifurcation from a uniform marching state to columnar structures\, suggestive of the formation of hopper bands.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-andrew-j-bernoff-hmc/
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:20181016T121500
DTEND;TZID=America/Los_Angeles:20181016T131000
DTSTAMP:20260407T043004
CREATED:20181008T194923Z
LAST-MODIFIED:20181008T194923Z
UID:897-1539692100-1539695400@colleges.claremont.edu
SUMMARY:The Bateman—Horn Conjecture\, Part I: heuristic derivation (Stephan Garcia\, Pomona)
DESCRIPTION:The Bateman—Horn Conjecture is a far-reaching statement about the distribution of the prime numbers.  It implies many known results\, such as the Green—Tao theorem\, and a variety of famous conjectures\, such as the Twin Prime Conjecture.  In this expository talk\, we start from basic principles and provide a heuristic argument in favor of the conjecture.  This talk should be accessible to undergraduates with a background in modular arithmetic.
URL:https://colleges.claremont.edu/ccms/event/the-bateman-horn-conjecture-part-i-heuristic-derivation-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:20181017T161500
DTEND;TZID=America/Los_Angeles:20181017T171500
DTSTAMP:20260407T043004
CREATED:20180904T171513Z
LAST-MODIFIED:20181001T150735Z
UID:499-1539792900-1539796500@colleges.claremont.edu
SUMMARY:Great Expectations (Matthew Junge\, Duke Univ.)
DESCRIPTION:The mean of a random quantity is supposed to confirm our expectations. What happens when it defies them? We will look at a few famous expected values; some old\, some new\, all great.
URL:https://colleges.claremont.edu/ccms/event/great-expectations/
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:20181024T161500
DTEND;TZID=America/Los_Angeles:20181024T171500
DTSTAMP:20260407T043004
CREATED:20180928T170717Z
LAST-MODIFIED:20181013T155440Z
UID:841-1540397700-1540401300@colleges.claremont.edu
SUMMARY:Isometric Circle Actions (Catherline Searle\, Wichita State)
DESCRIPTION:I will begin by describing a number of important examples of isometric actions of circles in Euclidean space and their restrictions to subspaces of Euclidean space. The goal of the talk will be to see how isometric actions of circles and tori can be used to “recognize” the space on which they are acting.
URL:https://colleges.claremont.edu/ccms/event/catherline-searle-wichita-state/
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:20181029T161500
DTEND;TZID=America/Los_Angeles:20181029T171500
DTSTAMP:20260407T043004
CREATED:20180910T073543Z
LAST-MODIFIED:20181016T222630Z
UID:520-1540829700-1540833300@colleges.claremont.edu
SUMMARY:Minimal Gaussian Partitions\, Clustering Hardness and Voting (Steven Heilman\, USC)
DESCRIPTION:A single soap bubble has a spherical shape since it minimizes its surface area subject to a fixed enclosed volume of air.  When two soap bubbles collide\, they form a “double-bubble” composed of three spherical caps.  The double-bubble minimizes total surface area among all sets enclosing two fixed volumes.  This was proven mathematically in a landmark result by Hutchings-Morgan-Ritore-Ros and Reichardt using the calculus of variations in the early 2000s.  The analogous case of three or more Euclidean sets is considered difficult if not impossible.  However\, if we replace Lebesgue measure in these problems with the Gaussian measure\, then recent work of myself (for 3 sets) and of Milman-Neeman (for any number of sets) can actually solve these problems.  We also use the calculus of variations.  We will discuss applications of this Gaussian “multi-bubble” problem to optimal clustering of data and to designing elections that are resilient to hacking.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-given-by-prof-steven-heilman/
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:20181030T121500
DTEND;TZID=America/Los_Angeles:20181030T131000
DTSTAMP:20260407T043004
CREATED:20180823T224159Z
LAST-MODIFIED:20181024T083012Z
UID:471-1540901700-1540905000@colleges.claremont.edu
SUMMARY:Uniform asymptotic growth of symbolic powers  (Robert Walker\, University of Michigan)
DESCRIPTION:Algebraic geometry (AG) is a major generalization of linear algebra which is fairly influential in mathematics. Since the 1980’s with the development of computer algebra systems like Mathematica\, AG has been leveraged in areas of STEM as diverse as statistics\, robotic kinematics\, computer science/geometric modeling\, and mirror symmetry. Part one of my talk will be a brief introduction to AG\, to two notions of taking powers of ideals (regular vs symbolic) in Noetherian commutative rings\, and to the ideal containment problem that I study in my thesis. Part two of my talk will focus on stating the main results of my thesis in a user-ready form\, giving a “comical” example or two of how to use them. At the risk of sounding like Paul Rudd in Ant-Man\, I hope this talk with be awesome.
URL:https://colleges.claremont.edu/ccms/event/tba-4/
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:20181031T161500
DTEND;TZID=America/Los_Angeles:20181031T171500
DTSTAMP:20260407T043004
CREATED:20180928T171011Z
LAST-MODIFIED:20181025T210738Z
UID:845-1541002500-1541006100@colleges.claremont.edu
SUMMARY:Saving Bats from Fungal Diseases with Linear Algebra (Nina Fefferman\, U of Tennessee-Knoxville)
DESCRIPTION:Abstract: Bats in North America have been dying off due to the invasion of a fungal disease (White Nose Syndrome). In this talk\, I’ll present a very simple linear algebraic model to predict the magnitude of the die-offs. By comparing these models to some data about actual bat survival\, my collaborator and I also hypothesized that the disease might be causing rapid evolution in the bat populations and this could give some populations better hope of surviving. I’ll go through these models and show how the predictions they make are different from models that don’t include bat evolution. I’ll also talk a little about some of the intervention strategies that have been proposed to help bat populations survive\, and use these models to show how some of them might accidentally hurt rather than help\, if we don’t figure out whether the main impacts of disease are evolutionary or immunological first.
URL:https://colleges.claremont.edu/ccms/event/nina-fefferman-u-of-tennessee-knoxville/
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:20181103T100000
DTEND;TZID=America/Los_Angeles:20181103T120000
DTSTAMP:20260407T043004
CREATED:20181002T034850Z
LAST-MODIFIED:20181020T192824Z
UID:884-1541239200-1541246400@colleges.claremont.edu
SUMMARY:GEMS Workshop: Exploring the fascinating world of prime numbers\, Part I with Professor  Adolfo Rumbos\, from Pomona College.
DESCRIPTION:TOPIC: Exploring the fascinating world of prime numbers\, Part I \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 November 3\, 2018 please click on the following link: \nhttps://tinyurl.com/GEMS2018Fall2 \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/
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:20181105T161500
DTEND;TZID=America/Los_Angeles:20181105T171500
DTSTAMP:20260407T043004
CREATED:20180808T152839Z
LAST-MODIFIED:20181021T054250Z
UID:416-1541434500-1541438100@colleges.claremont.edu
SUMMARY:CFTP: the algorithm ERGM deserves\, but not the one it needs right now (Matt Moores\, University of Wollongong)
DESCRIPTION:The exchange algorithm enables Bayesian posterior inference for models with intractable likelihoods\, such as Ising\, Potts\, or exponential random graph models (ERGM). Crucially\, this algorithm relies on an auxiliary Markov chain to obtain an unbiased sample from the generative distribution of the model.             It was originally proposed to use coupling from the past (CFTP) for this purpose\, but this requires the Markov chain to be uniformly ergodic. In the case of the Ising model\, coupling time increases super-exponentially for parameter values larger than the critical point. Alternatives to CFTP\, such as perfect slice sampling or bounding chains for Swendsen-Wang\, have been proposed for the Ising model. However\, there are currently no suitable alternatives for ERGM\, which also features a phase transition that can cause problems with convergence. This talk will review some recent work on simulation algorithms for ERGM and discuss how this problem might be addressed.\n\nThis is joint work with Kerrie Mengersen and Chris Drovandi (QUT\, Australia)\, Antonietta Mira (USI Lugano\, Switzerland)\, and Alberto Caimo (Dublin Inst. Tech.\, Ireland).
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-talk-title-tba/
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:20181106T121500
DTEND;TZID=America/Los_Angeles:20181106T131000
DTSTAMP:20260407T043004
CREATED:20180911T214141Z
LAST-MODIFIED:20181102T201125Z
UID:537-1541506500-1541509800@colleges.claremont.edu
SUMMARY:Turning probability into polynomials (Mark Huber\, CMC)
DESCRIPTION:Moment generating functions (Laplace transforms) are a means for transforming probability problems into problems involving polynomials.  Here I will concentrate on the binomial distribution\, and use the mgf to link this distributions probabilities directly to the binomial theorem.  The mgf is also a key ingredient in Chernoff bounds\, which give upper bounds on the tail probabilities of binomial distributions (aka partial sums of the binomial theorem).  By employing the method of smoothing and tilting\, it is possible to attain bounds on the tails that go down faster than the traditional approximation heuristic that uses the Central Limit Theorem.
URL:https://colleges.claremont.edu/ccms/event/talk-by-mark-huber-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:20181107T161500
DTEND;TZID=America/Los_Angeles:20181107T171500
DTSTAMP:20260407T043004
CREATED:20180928T171215Z
LAST-MODIFIED:20181102T194937Z
UID:847-1541607300-1541610900@colleges.claremont.edu
SUMMARY:The Legacy of Rudolph Kalman (Andrew Stuart\, Caltech)
DESCRIPTION:Abstract: In 1960 Rudolph Kalman published what is arguably the first paper to develop a systematic\, principled approach to the use of data to improve the predictive capability of mathematical models. As our ability to gather data grows at an enormous rate\,  the importance of this work continues to grow too. The lecture will describe this paper\, and developments that have stemmed from it\, revolutionizing fields such space-craft control\, weather prediction\, oceanography\, oil recovery\, medical imaging and artificial intelligence. Some mathematical details will be also provided\, but limited to simple concepts such as optimization and iteration; the  talk is designed to be broadly accessible to anyone with an  interest in quantitative science.
URL:https://colleges.claremont.edu/ccms/event/andrew-stuart-caltech/
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:20181108T161500
DTEND;TZID=America/Los_Angeles:20181108T171500
DTSTAMP:20260407T043004
CREATED:20181101T220906Z
LAST-MODIFIED:20181102T043346Z
UID:930-1541693700-1541697300@colleges.claremont.edu
SUMMARY:Crossing the Threshold: The Role of Demographic Stochasticity in the Evolution of Cooperation (Tom LoFaro\, Gustavus Adolphus College)
DESCRIPTION:When Charles Darwin began writing “On the Origin of Species” he knew that explaining cooperative behavior in the context of “survival of the fittest” was problematic.  In fact\, this apparent contradiction puzzled ecologists for many years after.  In this talk we will discuss a mathematical model of the evolution of cooperation developed by Doebeli\, Blarer\, and Ackermann that incorporates ideas from game theory into a standard population genetics model.  We will show that if the model is viewed deterministically then cooperative behavior cannot spread from rarity.  However\, if birth rates are stochastic then cooperative behavior might spread.  We will explore why this is so and describe conditions that increase the probability that cooperative behavior will become established.
URL:https://colleges.claremont.edu/ccms/event/crossing-the-threshold-the-role-of-demographic-stochasticity-in-the-evolution-of-cooperation-tom-lofaro-gustavus-adolphus-college/
LOCATION:Shanahan 3465\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181112T161500
DTEND;TZID=America/Los_Angeles:20181112T171500
DTSTAMP:20260407T043004
CREATED:20180910T183619Z
LAST-MODIFIED:20181101T041237Z
UID:523-1542039300-1542042900@colleges.claremont.edu
SUMMARY:Digital sequences for frequency hopping CDMA systems (Lenny Fukshansky\, CMC)
DESCRIPTION:Frequency hopping is a method of transmitting signals by rapidly switching between many frequency channels\, following some sequence of frequencies known to the transmitter and the receiver. This technique is used in the CDMA (code division multiple access) systems\, and has many civilian and military applications. For successful transmission minimizing signal interference\, we want to use sets of digital frequency sequences with minimal Hamming cross-correlation\, which measures frequency overlaps with time shifts between two different sequences. We discuss a construction of a new family of one-coincidence sequences like this coming from some basic arithmetic of finite fields\, which have some nice properties. This is joint work with Adib Shaar\, and this talk is dedicated to his memory.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-lenny-fukshansky/
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:20181113T121500
DTEND;TZID=America/Los_Angeles:20181113T131000
DTSTAMP:20260407T043004
CREATED:20180912T174329Z
LAST-MODIFIED:20181105T225953Z
UID:551-1542111300-1542114600@colleges.claremont.edu
SUMMARY:Cayley digraphs of matrix rings over finite fields (Yesim Demiroglu\, HMC)
DESCRIPTION:In this talk we use the unit-graphs and the special unit-digraphs on matrix rings to show that every n x n nonzero matrix over F_q can be written as a sum of two SL_n-matrices when n>1. We compute the eigenvalues of these graphs in terms of Kloosterman sums and study their spectral properties; and prove that if X is a subset of Mat_2 (F_q) with size |X| > (2 q^3 \sqrt{q})/(q – 1)\, then X contains at least two distinct matrices whose difference has determinant $\alpha$ for any $\alpha \in F_q^*$. Using this result we also prove a sum-product type result: if $A\,B\,C\,D \subseteq F_q$ satisfy $\sqrt[4]{|A||B||C||D|}= \Omega (q^{0.75})$ as q tends to infinity\, then $(A – B)(C – D)$ equals all of $F_q$. In particular\, if A is a subset of F_q with cardinality $|A| > \frac{3}{2} q^{3/4}$\, then the subset $(A – A) (A – A)$ equals all of $F_q$. We also recover a classical result: every element in any finite ring of odd order can be written as the sum of two units. This talk should be accessible to undergraduates with some background in linear algebra.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-yesim-demiroglu-hmc/
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:20181114T161500
DTEND;TZID=America/Los_Angeles:20181114T171500
DTSTAMP:20260407T043004
CREATED:20180928T171315Z
LAST-MODIFIED:20181109T164101Z
UID:849-1542212100-1542215700@colleges.claremont.edu
SUMMARY:Coupled Mechanochemical Multiscale Model to Study the Growth Regulation and Morphogenesis during Tissue Development (Weitao Chen\, UCR)
DESCRIPTION:Growth regulation and pattern formation are two main problems in developmental biol-\nogy. How cells know when to stop growing at certain tissue size with specic shape is an important\nquestion in both developmental biology and regenerative medicine\, and it is still an unsolved mystery\nin many systems. During the growth\, tissues and organs always exhibit self-government to some\nextent. Cells stop proliferation precisely when the intended size of the tissue or organ is achieved.\nMeanwhile\, dierential cell shapes in space are integrated to give rise to well-organized overall struc-\nture. Uncontrolled growth of the cells in tissues or organs will lead to abnormal development or\nfatal diseases such as cancer. Therefore\, developing an extensible predictive mathematical model\nfor exploring the mechanisms involved in the tissue development is signicant for understanding\nthe fundamental principles in developmental biology\, with a broad range of applications from tissue\nengineering to biomanufacturing and biotech industry. Experimental data suggests that mechanical\nproperties of cells and chemical signals in both intracellular and extracellular domains play critical\nroles in size control and shape formation. Here we develop a multiscale\, mechochemical coupled\nmodel of tissue growth control. This rst-of-class modeling approach provides sub-cellular details\nto both mechanical properties and chemical signaling during tissue growth. This model is applied\nto test competing hypotheses in the eld to resolve the highly debated question of how tissues reach\ntheir nal size\, as well as how the tissue shape is determined simultaneously.
URL:https://colleges.claremont.edu/ccms/event/weitao-chen-ucr/
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:20181119T161500
DTEND;TZID=America/Los_Angeles:20181119T171500
DTSTAMP:20260407T043004
CREATED:20180808T225017Z
LAST-MODIFIED:20181109T020610Z
UID:422-1542644100-1542647700@colleges.claremont.edu
SUMMARY:Turing mechanism for homeostatic control of synaptic density during C. elegans growth (Heather Zinn Brooks\, UCLA)
DESCRIPTION:It has been observed that motor neuron synapses in the worm C. elegans are remarkably evenly spaced\, even during growth and development. In this work\, we propose a novel mechanism for Turing pattern formation that provides a possible explanation for the regular spacing of synapses along the ventral cord of C. elegans during development. The model consists of two interacting chemical species\, where one is passively diffusing and the other is actively trafficked by molecular motors; we identify the former as the kinase CaMKII and the latter as the glutamate receptor GLR-1. We use linear stability analysis to derive conditions on the associated nonlinear interaction functions for which a Turing instability can occur. We find that the dimensionless quantity $\gamma$\, the ratio of switching rate and diffusion coefficient to motor transport velocity\, must be sufficiently small for patterns to emerge. One consequence is that patterns emerge outside the parameter regime of fast switching where the model effectively reduces to a two component reaction-diffusion system. Furthermore\, these patterns are also maintained during domain growth. We discuss selection and stability of patterns for this mechanism in both 1- and 2-dimensional domains.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-given-by-dr-heather-zinn-brooks-ucla/
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:20181121T161500
DTEND;TZID=America/Los_Angeles:20181121T171500
DTSTAMP:20260407T043004
CREATED:20181030T210551Z
LAST-MODIFIED:20181030T210551Z
UID:927-1542816900-1542820500@colleges.claremont.edu
SUMMARY:No colloquium (Thanksgiving week)
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/no-colloquium-thanksgiving-week/
LOCATION:CA
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181126T161500
DTEND;TZID=America/Los_Angeles:20181126T171500
DTSTAMP:20260407T043004
CREATED:20181124T043635Z
LAST-MODIFIED:20181124T043635Z
UID:958-1543248900-1543252500@colleges.claremont.edu
SUMMARY:A renormalization approach to existence of the blow-up solutions of the Navier-Stokes equations (Denis Gaidashev\, Uppsala University\, Sweden)
DESCRIPTION:The Navier-Stokes existence and smoothness problem is one of the most important open problems in modern mathematics.   Ya. Sinai and D. Li have proposed a renormalization approach to constructing a counter-example to existence. In this approach\, existence of  a blow-up solution (a solution whose energy becomes infinite in finite time) is equivalent to existence of fixed point of an appropriate operator in some functional space.  We will explain a computer assited technique which can be conjecturally used to prove existence of such a fixed point for 3D NS equations\, and describe our numerical evidence for a fixed point in the setting of a 1D version of NS.
URL:https://colleges.claremont.edu/ccms/event/a-renormalization-approach-to-existence-of-the-blow-up-solutions-of-the-navier-stokes-equations-denis-gaidashev-uppsala-university-sweden/
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:20181127T121500
DTEND;TZID=America/Los_Angeles:20181127T131000
DTSTAMP:20260407T043004
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:20260407T043004
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:20260407T043004
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:20260407T043004
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:20260407T043004
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:20260407T043004
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:20260407T043004
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
END:VCALENDAR