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: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
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:20200309T161500
DTEND;TZID=America/Los_Angeles:20200309T171500
DTSTAMP:20260415T081345
CREATED:20191205T210642Z
LAST-MODIFIED:20200306T231655Z
UID:1684-1583770500-1583774100@colleges.claremont.edu
SUMMARY:(Cancelled!!) Applied Math Talk: Stable planar vegetation stripe patterns on sloped terrain in dryland ecosystems given by Prof. Paul Carter (University of Minnesota)
DESCRIPTION:In water-limited regions\, competition for water resources results in the formation of vegetation patterns; on sloped terrain\, one finds that the vegetation typically aligns in stripes or arcs. The dynamics of these patterns can be modeled by reaction-diffusion PDEs describing the interplay of vegetation and water resources\, where sloped terrain is modeled through advection terms representing the downhill flow of water. We focus on one such model in the ‘large-advection’ limit\, and we prove the existence of traveling planar stripe patterns using analytical and geometric techniques. We also discuss implications for the stability of the resulting patterns\, as well as the appearance of curved stripe solutions.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-paul-carter-university-of-minnesota/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200303T121500
DTEND;TZID=America/Los_Angeles:20200303T131000
DTSTAMP:20260415T081345
CREATED:20200203T174750Z
LAST-MODIFIED:20200227T042826Z
UID:1851-1583237700-1583241000@colleges.claremont.edu
SUMMARY:Graph coloring reconfiguration systems (Prateek Bhakta\, University of Richmond)
DESCRIPTION:For k >= 2\, the k-coloring graph C(G) of a base graph G has a vertex set consisting of the proper k-colorings of G with edges connecting two vertices corresponding to two different colorings of G if those two colorings differ in the color assigned to a single vertex of G. A base graph whose k-coloring graph is connected is called k-mixing; here it is possible to reconfigure a particular k-coloring of G to any other k-coloring of G by changing the color of one vertex at a time in the assignment while maintaining that each intermediate step is a proper k-coloring. We explore the connectivity and biconnectivity of coloring graphs with a focus on the inverse problem: given a graph H\, is H the k coloring graph of some base graph G for some k?
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-prateek-bhaktaw-university-of-richmond/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200302T161500
DTEND;TZID=America/Los_Angeles:20200302T171500
DTSTAMP:20260415T081345
CREATED:20190910T224521Z
LAST-MODIFIED:20200220T193630Z
UID:1518-1583165700-1583169300@colleges.claremont.edu
SUMMARY:Applied Math Talk: Approaches to modeling dispersal and swarm behavior at multiple scales given by Prof. Christopher Strickland ( The University of Tennessee\, Knoxville)
DESCRIPTION:Biological invasions often have outsized consequences for the invaded ecosystem and represent an interesting challenge to model mathematically. Landscape heterogeneity\, non-local or time-dependent spreading mechanisms\, coarse data\, and air or water flow transport are but a few of the complications that can greatly affect our understanding of small organism movement – a critical component of both invasion success and the ability of native organisms to persist at a location. In this talk\, I will look at dispersal and swarm behavior from a multi-scale\, mathematical perspective in order to address some of these challenges. \nConsidering the problem of long-distance dispersal\, I will discuss a method for modeling invasive spread over large\, heterogeneous landscapes by interpreting the quantity of interest as the probability of species occurrence rather than population size. On large scales\, one can also take advantage of ecological niche modeling approaches in order to reduce the dimensionality of data quantifying landscape heterogeneity. I will then shift focus to the initial stages of an invasion and concentrate on the local- and meso-scale by considering the intentional release of a parasitoid wasp biocontrol agent. In this case\, we can utilize a Bayesian framework and maximum likelihood estimation to parameterize the model based on proxy time-series data collected in the field. Finally\, I will describe some of my current work close to the microscale examining the dynamics of organism movement and behavior with respect to a surrounding fluid environment.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-christina-edholm-scripps-college/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200218T121500
DTEND;TZID=America/Los_Angeles:20200218T131000
DTSTAMP:20260415T081345
CREATED:20191221T204555Z
LAST-MODIFIED:20200201T061024Z
UID:1699-1582028100-1582031400@colleges.claremont.edu
SUMMARY:On badly approximable numbers (Nikolai Moshchevitin\, Moscow State University)
DESCRIPTION:It is well known that a real number is badly approximable if and only if the partial quotients in its continued fraction expansion are bounded. Motivated by a recent wonderful paper by Ngoc Ai Van Nguyen\, Anthony Poels and Damien Roy (where the authors give a simple alternative solution of Schmidt-Summerer’s problem) we found an unusual generalization of this criterion for badly approximable d-dimensional vectors.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-nikolai-moshchevitin-moscow-state-university/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200217T161500
DTEND;TZID=America/Los_Angeles:20200217T171500
DTSTAMP:20260415T081345
CREATED:20200117T182454Z
LAST-MODIFIED:20200204T175507Z
UID:1774-1581956100-1581959700@colleges.claremont.edu
SUMMARY:Applied Math Talk: Information Theory\, Archetypal Analysis and MT Flu given by Professor Emily Stone (University of Montana-Missoula)
DESCRIPTION:In this talk I will discuss a rather unique collection of tools and how they have been used to understand the spread of Influenza virus in the State of Montana.  With flu counts from each county over a 10 year period some patterns emerge\, which explain some vectors of the disease spread.  Archetypal analysis then creates reduced dimension sets\, and the dynamics of the flu spread can be understood by parameterizing SIR models with the reduced data.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-professor-emily-stone-university-of-montana/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200211T121500
DTEND;TZID=America/Los_Angeles:20200211T131000
DTSTAMP:20260415T081345
CREATED:20200129T000815Z
LAST-MODIFIED:20200202T234446Z
UID:1823-1581423300-1581426600@colleges.claremont.edu
SUMMARY:Quandle module quivers (Sam Nelson\, CMC)
DESCRIPTION:Quandle coloring quivers categorify the quandle counting invariant. In this talk we enhance the quandle coloring quiver invariant with quandle modules\, generalizing both the quiver invariant and the quandle module polynomial invariant. This is joint work with Karma Istanbouli (Scripps College).
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-sam-nelson-cmc/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200210T161500
DTEND;TZID=America/Los_Angeles:20200210T171500
DTSTAMP:20260415T081345
CREATED:20200128T002046Z
LAST-MODIFIED:20200131T221151Z
UID:1808-1581351300-1581354900@colleges.claremont.edu
SUMMARY:Applied Math Talk: Robust Estimators for Monte Carlo data given by Prof.  Mark Huber (CMC)
DESCRIPTION:Data coming from Monte Carlo experiments is often analyzed in the same way as data from more traditional sources.  The unique nature of Monte Carlo data\, where it is easy to take a random number of samples\, allows for estimators where the user can control the relative error of the estimate much more precisely than with classical approaches.  In this talk I will discuss three such estimators useful in different problems.  The first is a user-specified-relative-error (USRE) estimate for the mean of a Bernoulli random variable.  This allows us to obtain exact error results while using slightly fewer samples than the CLT approximation.  The second is more general\, applying to any random variable where a bound on the relative error is known.  For this problem we give exact error bounds using a number of samples that is the same (to first order) as the CLT approximation requires.  In other words\, the new algorithm is the equivalent of always actually having normal data.  Finally\, we look at the problem of data with unknown variance and develop an algorithm that runs very close to the minimum number of samples established by results of Wald.  
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-mark-huber/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200204T121500
DTEND;TZID=America/Los_Angeles:20200204T131000
DTSTAMP:20260415T081345
CREATED:20200129T003031Z
LAST-MODIFIED:20200129T003031Z
UID:1831-1580818500-1580821800@colleges.claremont.edu
SUMMARY:Covering point-sets with parallel hyperplanes and sparse signal recovery (Lenny Fukshansky\, CMC)
DESCRIPTION:Let S be a set of k > n points in n-dimensional Euclidean space. How many parallel hyperplanes are needed to cover it? In fact\, it is easy to prove that every such set can be covered by k-n+1 parallel hyperplanes\, but do there exist sets that cannot be covered by fewer parallel hyperplanes? We construct a family of examples of such extremal sets. We then use it\, along with a result on girth of bipartite graphs\, to construct a family of n x d integer matrices with bounded sup-norm and the property that no m column vectors are linearly dependent\, m < n. If m < (log n)^{1-e} for any e > 0\, then d/n tends to infinity as n tends to infinity. This is a deterministic construction of a family of sensing matrices\, which are used for sparse signal recovery in compressed sensing. Joint work with Alex Hsu.
URL:https://colleges.claremont.edu/ccms/event/covering-point-sets-with-parallel-hyperplanes-and-sparse-signal-recovery-lenny-fukshansky-cmc/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200128T121500
DTEND;TZID=America/Los_Angeles:20200128T131000
DTSTAMP:20260415T081345
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:20200127T161500
DTEND;TZID=America/Los_Angeles:20200127T171500
DTSTAMP:20260415T081345
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:20200123T121500
DTEND;TZID=America/Los_Angeles:20200123T131000
DTSTAMP:20260415T081345
CREATED:20191008T203742Z
LAST-MODIFIED:20200120T195443Z
UID:1599-1579781700-1579785000@colleges.claremont.edu
SUMMARY:Dragging the roots of a polynomial to the unit circle (Sinai Robins\, University of Sao Paulo)
DESCRIPTION:Several conditions are known for a self-inversive polynomial that ascertain the location of its roots\, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials p_α(x) to each such polynomial p\, and define cn(p)\, il(p) to be the sharp threshold values of α that guarantee that\, for all larger values of the parameter\, p_α(x) has\, respectively\, all roots in the unit circle and all roots interlacing the roots of unity of the same degree.  Interlacing implies circle rootedness\, hence il(p) ≥ cn(p)\, and this inequality is often used for showing circle rootedness. Both il(p) and cn(p) turn out to be semi-algebraic functions of the coefficients of p\, and some useful bounds are also presented\, entailing several known results about roots in the circle. The study of il(p) leads to a rich classification of real self-inversive polynomials of each degree\, organizing them into a complete polyhedral fan. We have a close look at the class of polynomials for which il(p) = cn(p)\, whereas in general the quotient il(p)/cn(p) is shown to be unbounded as the degree grows. Several examples and open questions are presented.  This is joint work with Arnaldo Mandel.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-sinai-robins-university-of-sao-paulo/
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:20191210T121500
DTEND;TZID=America/Los_Angeles:20191210T131000
DTSTAMP:20260415T081345
CREATED:20190910T235400Z
LAST-MODIFIED:20191206T231105Z
UID:1526-1575980100-1575983400@colleges.claremont.edu
SUMMARY:Computational bounds for doing harmonic analysis on permutation modules of finite groups (Mike Orrison\, HMC)
DESCRIPTION:In this talk\, I will describe an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of permutation modules\, and it uses the multiplicities of irreducible submodules within individual orbital spaces to express the resulting computational bounds. I will then conclude by showing that these bounds are surprisingly small when dealing with certain permutation modules arising from the action of the symmetric group on tabloids. This is joint work with Michael Hansen\, Masanori Koyama\, Matthew McDermott\, and Sarah Wolff.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-mike-orrison-hmc/
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:20191209T161500
DTEND;TZID=America/Los_Angeles:20191209T171500
DTSTAMP:20260415T081345
CREATED:20190909T233651Z
LAST-MODIFIED:20191209T043203Z
UID:1507-1575908100-1575911700@colleges.claremont.edu
SUMMARY:Applied Math Talk: Set your parasites low (or high) given by Professor Maryann Hohn (Pomona College)
DESCRIPTION:Individuals may choose to create social groups where their individual fitness and success is influenced by those around them.  A group may increase an individual’s success in finding food\, shelter\, and safety; however\, if the group fails\, so does the individual.  In this talk\, we will explore how choices of individuals influence group dynamics using both agent-based modeling and partial differential equations.  In particular\, we will examine individuals who live in close\, collaborate groups who are susceptible to infectious diseases such as pathogens and parasites through their social network.
URL:https://colleges.claremont.edu/ccms/event/maryann-hohn-pomona-college/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20191203T121500
DTEND;TZID=America/Los_Angeles:20191203T131000
DTSTAMP:20260415T081345
CREATED:20190826T173520Z
LAST-MODIFIED:20191125T232345Z
UID:1376-1575375300-1575378600@colleges.claremont.edu
SUMMARY:ANTC Seminar: Random Monomial Ideals (Lily Silverstein\, CalPoly Pomona)
DESCRIPTION:Probability is a now-classic tool in combinatorics\, especially graph theory. Some applications of probabilistic techniques are: (1) describing the typical/expected properties of a class of objects\, (2) uncovering phase transitions and sudden thresholds in the dependence of one property on another\, and (3) producing examples of conjectured or unusual objects. (This last technique is sometimes called “the probabilistic method.”)\n\nThis talk will apply these techniques to commutative algebra\, using monomial ideals as a bridge between combinatorics and algebra. I’ll introduce a family of random models for monomial ideals\, and describe results of each type mentioned above\, for instance: (1) typical projective dimension\, (2) thresholds in Krull dimension as a function of number of monomial generators\, and (3) how to generate unlimited examples of monomial ideals which aren’t generic (in the Bayer-Peeva-Sturmfels sense)\, but which nevertheless have minimal free resolutions that can be read from their Scarf complexes.\n\nJoint work with subsets of: Jesús A. De Loera\, Serkan Hoşten\, Robert Krone\, Sonja Petrović\, Despina Stasi\, Dane Wilburne\, and Jay Yang.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-lily-silverstein-calpoly-pomona/
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:20191202T161500
DTEND;TZID=America/Los_Angeles:20191202T171500
DTSTAMP:20260415T081345
CREATED:20191107T212329Z
LAST-MODIFIED:20191121T082301Z
UID:1636-1575303300-1575306900@colleges.claremont.edu
SUMMARY:Applied Math Seminar On Unlimited Sampling given by Prof. Felix Krahmer (Technische Universität München)
DESCRIPTION:Shannons sampling theorem provides a link between the continuous and thediscrete realms stating that bandlimited signals are uniquely determined by itsvalues on a discrete set. This theorem is realized in practice using so called analog to digital converters (ADCs). Unlike Shannons sampling theorem\, the ADCs are limited in dynamic range. Whenever a signal exceeds some preset threshold\, the ADC saturates\, resulting in aliasing due to clipping. In this talk\,we analyze an alternative approach that does not suffer from these problems.Our work is based on recent developments in ADC design\, which allow for ADCs that reset rather than to saturate\, thus producing modulo samples. An open problem that remains is: Given such modulo samples of a bandlimited function as well as the dynamic range of the ADC\, how can the original signal be recovered and what are the sufficient conditions that guarantee perfect recovery? In this paper\, we prove such sufficiency conditions and complement them with a stable recovery algorithm. Our results not limited to certain amplitude ranges\, in fact even the same circuit architecture allows for the recovery of arbitrary large amplitudes as long as some estimate of the signal norm is available whenrecovering. \nThis is joint work with Ayush Bhandari (Imperial College London) and Ramesh Raskar (MIT). \nBio: \nFelix Krahmer received his PhD in Mathematics in 2009 from New York University under the supervision of Percy Deift and Sinan Güntürk. He was a Hausdorff postdoc in the group of Holger Rauhut at the University of Bonn\, Germany from 2009-2012. In 2012 he joined the University of Göttingen as a an assistant professor for mathematical data analysis\, where he has been awarded an Emmy Noether Junior Research Group. Since 2015 he has been tenure track assistant professor for optimization and data analysis in the department of mathematics at the Technical University of Munich.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-given-by-prof-felix-krahmer-technische-universitat-munchen/
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:20191202T121500
DTEND;TZID=America/Los_Angeles:20191202T131000
DTSTAMP:20260415T081345
CREATED:20200116T235236Z
LAST-MODIFIED:20200116T235237Z
UID:1772-1575288900-1575292200@colleges.claremont.edu
SUMMARY:ANTC Seminar: Random Monomial Ideals (Lily Silverstein\, CalPoly Pomona)
DESCRIPTION:Probability is a now-classic tool in combinatorics\, especially graph theory. Some applications of probabilistic techniques are: (1) describing the typical/expected properties of a class of objects\, (2) uncovering phase transitions and sudden thresholds in the dependence of one property on another\, and (3) producing examples of conjectured or unusual objects. (This last technique is sometimes called “the probabilistic method.”)\nThis talk will apply these techniques to commutative algebra\, using monomial ideals as a bridge between combinatorics and algebra. I’ll introduce a family of random models for monomial ideals\, and describe results of each type mentioned above\, for instance: (1) typical projective dimension\, (2) thresholds in Krull dimension as a function of number of monomial generators\, and (3) how to generate unlimited examples of monomial ideals which aren’t generic (in the Bayer-Peeva-Sturmfels sense)\, but which nevertheless have minimal free resolutions that can be read from their Scarf complexes.\nJoint work with subsets of: Jesús A. De Loera\, Serkan Hoşten\, Robert Krone\, Sonja Petrović\, Despina Stasi\, Dane Wilburne\, and Jay Yang.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-random-monomial-ideals-lily-silverstein-calpoly-pomona/
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:20191126T121500
DTEND;TZID=America/Los_Angeles:20191126T131000
DTSTAMP:20260415T081345
CREATED:20190821T210731Z
LAST-MODIFIED:20191123T222257Z
UID:1361-1574770500-1574773800@colleges.claremont.edu
SUMMARY:Exponential domination in grids (Michael Young\, Iowa State University)
DESCRIPTION:Domination in graphs has been an important and active topic in graph theory for over 40 years. It has immediate applications in visibility and controllability. In this talk we will discuss a generalization of domination called exponential domination. A vertex $v$ in an exponential dominating set assigns weight $2^{1−dist(v\,u)}$ to vertex $u$. An exponential dominating set of a graph $G$ is a subset of $V(G)$ such that every vertex in $V(G)$ has been assigned a sum weight of at least 1. We will specifically look at grid graphs and graphs on the torus.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-michael-young-iowa-state-university/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20191125T161500
DTEND;TZID=America/Los_Angeles:20191125T171500
DTSTAMP:20260415T081345
CREATED:20190909T232742Z
LAST-MODIFIED:20191112T033822Z
UID:1501-1574698500-1574702100@colleges.claremont.edu
SUMMARY:Applied Math Talk: Patterns deformed by spatial inhomogeneity give by Prof. Jasper Weinburd (HMC)
DESCRIPTION:At the turn of the twentieth century\, physicist Henri Bénard heated a shallow plate of fluid from below. For temperatures above a critical value\, the fluid’s evenly heated state became unstable as thermal convection took hold; heated fluid rose in localized areas while cooler fluid fell nearby. The rising and falling fluid created hexagonal convection cells\, squares\, and stripes.\nSuppose that we modify Bénard’s experiment by heating only the left half plate. We expect the fluid on the right to remain stationary and only the the fluid on the left to form patterns. We confirm this intuition mathematically and\, more surprisingly\, find that the step-type inhomogeneity restricts the spatial period of the resulting patterns on the left. We examine this phenomenon using a universal partial differential equation model. The main difficulty arrises at the location of the discontinuous inhomogeneity because results on either side cannot be directly compared. We construct a transformation of variables that bridges this jump and allows a heteroclinic glueing argument from left to right. The explicit form of this transformation determines the widths of patterns that may occur in the inhomogeneous environment.
URL:https://colleges.claremont.edu/ccms/event/jasper-weinburd-pomona-college/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20191119T121500
DTEND;TZID=America/Los_Angeles:20191119T131000
DTSTAMP:20260415T081345
CREATED:20190910T235147Z
LAST-MODIFIED:20191113T223428Z
UID:1524-1574165700-1574169000@colleges.claremont.edu
SUMMARY:Recent developments biquandle brackets (Sam Nelson\, CMC)
DESCRIPTION:We review some recent developments in the study of biquandle brackets and other quantum enhancements.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sam-nelson-cmc-2/
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:20191112T121500
DTEND;TZID=America/Los_Angeles:20191112T131000
DTSTAMP:20260415T081345
CREATED:20191011T010916Z
LAST-MODIFIED:20191105T222544Z
UID:1608-1573560900-1573564200@colleges.claremont.edu
SUMMARY:Counting stuff with quantum Airy structures (Vincent Bouchard\, University of Alberta)
DESCRIPTION:Mathematicians like to count things. Often in very complicated and fancy ways. In this talk I will explain how we can use quantum Airy structures — an abstract formalism recently proposed by Kontsevich and Soibelman\, underlying the Eynard-Orantin topological recursion — to count various interesting geometric structures. Quantum Airy structures can be seen as a wide generalization of the famous Witten conjecture\, connecting enumerative geometry\, integrable systems\, representation theory and mathematical physics. It is a great example of “physical mathematics” in action\, with dualities in string theory and quantum field theory giving rise to fascinating\, unexpected results in pure mathematics.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-vincent-bouchard-university-of-alberta/
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:20191111T161500
DTEND;TZID=America/Los_Angeles:20191111T171500
DTSTAMP:20260415T081345
CREATED:20191022T164250Z
LAST-MODIFIED:20191105T183518Z
UID:1618-1573488900-1573492500@colleges.claremont.edu
SUMMARY:Applied Math Talk: Stochastic similarity matrices and data clustering given by Prof. Denis Gaidashev (Uppsala University)
DESCRIPTION:Clustering in image analysis is a central technique that allows to classify elements of an image. We describe a simple clustering technique that uses the method of similarity matrices\, and an algorithm in which a collection of image elements is treated as a dynamical system. Efficient clustering in this framework   is achieved if the dynamical system admits a spectral gap. \nWe expand upon recent results in spectral analysis for Gaussian mixture distributions\, and in particular\, provide conditions for the existence of a spectral gap between the leading and remaining eigenvalues for matrices with entries from a Gaussian mixture with two real univariate components.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-denis-gaidashev-uppsala-university/
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:20191105T121500
DTEND;TZID=America/Los_Angeles:20191105T131000
DTSTAMP:20260415T081345
CREATED:20190910T234841Z
LAST-MODIFIED:20191101T153056Z
UID:1522-1572956100-1572959400@colleges.claremont.edu
SUMMARY:Differential spectra of power permutations (Daniel Katz\, CSUN)
DESCRIPTION:If $F$ is a finite field and $d$ is a positive integer relatively prime to $|F^\times|$\, then the power map $x \mapsto x^d$ is a permutation of $F$\, and so is called a power permutation of $F$. For any function $f: F \to F$\, and $a\, b \in F$\, we define the differential multiplicity of $f$ with respect to $a$ and $b$\, written $\delta_f(a\,b)$\, to be the number of pairs $(x\,y) \in F^2$ with $x-y=a$ and $f(x)-f(y)=b$.  We usually insist that $a\not=0$\, since it is immediate that $\delta_f(0\,0)=|F|$ and $\delta_f(0\,b)=0$ for $b\not=0$.  The differential spectrum of $f$\, written $\Delta_f$\, is defined as $\Delta_f=\{\delta_f(a\,b): a \in F^\times\, b \in F\}$. Differential spectra of power permutations are of interest in applications to cryptography and digital communications.  We are especially interested in fields $F$ and exponents $d$ such $f(x)=x^d$ is a power permutation over $F$ whose differential spectrum contains at most three values. We present computational experiments that suggest conjectures as to which $(F\,d)$ pairs produce such spectra.  This is joint work with Kyle Pacheco and Yakov Sapozhnikov.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-daniel-katz-csun-2/
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:20191104T161500
DTEND;TZID=America/Los_Angeles:20191104T171500
DTSTAMP:20260415T081345
CREATED:20190803T171420Z
LAST-MODIFIED:20191026T215438Z
UID:1351-1572884100-1572887700@colleges.claremont.edu
SUMMARY:Markov Chains and Emergent Behavior in Programmable Matter given by Prof. Sarah Canon (CMC)
DESCRIPTION:Markov chains are widely used throughout mathematics\, statistics\, and the sciences\, often for modelling purposes or for generating random samples. In this talk I’ll discuss a different\, more recent application of Markov chains\, to developing distributed algorithms for programmable matter systems. Programmable matter is a material or substance that has the ability to change its features in a programmable\, distributed way; examples are diverse and include robot swarms and smart materials. We study an abstraction of programmable matter where particles independently move on a lattice according to simple\, local algorithms. We want to design these algorithms so that the system has a desired collective behavior\, such as compression of the particles into a shape with small perimeter or separation of differently colored particles. In our stochastic approach\, we describe a desired collective behavior using an energy function; design a Markov chain that uses local moves and converges to the Gibbs distribution for this energy function; and then turn the Markov chain into an asynchronous distributed algorithm that each particle can execute independently. In several of our algorithms\, changing just a single parameter results in a different\, but equally desirable\, emergent global behavior. To prove our algorithms are correct\, we must show this Gibbs distribution has the desired properties with high probability\, which we do using proof techniques from probability\, statistical physics\, and Markov chain analysis. This principled approach has been used to inform the design of real-world robot systems. Joint work with Marta Andres Arroyo\, Enis Aydin\, Joshua J. Daymude\, Bahnisikha Dutta\, Cem Gokmen\, Daniel I. Goldman\, Shengkai Li\, Dana Randall\, Andrea Richa\, William Savoie\, and Ross Warkentin.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-sarah-canon-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:20191029T121500
DTEND;TZID=America/Los_Angeles:20191029T131000
DTSTAMP:20260415T081345
CREATED:20190802T043328Z
LAST-MODIFIED:20190903T050156Z
UID:1347-1572351300-1572354600@colleges.claremont.edu
SUMMARY:Faster point counting for curves over prime power rings (Maurice Rojas\, Texas A&M)
DESCRIPTION:Counting points on algebraic curves over finite fields has numerous applications in communications and cryptology\, and has led to some of the most beautiful results in 20th century arithmetic geometry. A natural generalization is to count the number of points over prime power rings\, e.g.\, the integers modulo a prime power. However\, the theory behind the latter kind of point counting began more recently and there are numerous gaps in our algorithmic knowledge. \nWe give a simple combinatorial construction that reduces point counting over prime power point counting to the prime field case. In particular\, for any bivariate polynomial f in Z[x\,y] and positive integers p and k with p prime\, we show how one can count the number of roots of f in (Z/(p^k))^2 in time p^{1/2 + o(1)} (dk)^{O(1)}\, and even faster for certain curves. This generalizes earlier results of Cheng\, Lecerf\, Saxena\, and Wan in the univariate case\, and simplifies earlier work of Denef\, Igusa\, and Veys on local zeta functions. \nThis is joint work with Caleb Robelle and Yuyu Zhu.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-maurice-rojas-texas-am/
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:20191015T121500
DTEND;TZID=America/Los_Angeles:20191015T131000
DTSTAMP:20260415T081345
CREATED:20190830T203403Z
LAST-MODIFIED:20191010T171535Z
UID:1465-1571141700-1571145000@colleges.claremont.edu
SUMMARY:Sporadic points on modular curves (Ozlem Ejder\, Colorado State University)
DESCRIPTION:A classic and fundamental result in number theory is due to Mordell who proved that the set of points on an elliptic curve defined over a number field forms a finitely generated abelian group; in particular\, it has a finite torsion subgroup. An essential tool to study elliptic curves is the modular curves which are moduli spaces for elliptic curves with an additional structure.  In particular\, $X_1(n)$ classifies the elliptic curves with a point of order of $n$.  Motivated by the classification of torsion problems\, we study the sporadic points on the curve $X_1(n)$\, that is\, the closed points on $X_1(n)$ such that there are at most finitely many points of degree at most $\deg(x)$. In this talk\, we will discuss the finiteness of sporadic points. This is joint with A. Bourdon\, Y. Liu\, F. Odumudu and B. Viray.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-ozlem-ejder-colorado-state-university/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20191014T161500
DTEND;TZID=America/Los_Angeles:20191014T171500
DTSTAMP:20260415T081345
CREATED:20190911T055121Z
LAST-MODIFIED:20190919T171212Z
UID:1530-1571069700-1571073300@colleges.claremont.edu
SUMMARY:Applied Math Talk: A Full Asymptotic Series of European Call Option Prices in the SABR Model with Beta = 1 given by Zhengji Guo (CGU)
DESCRIPTION:We develop two new pricing formulae for European options. The purpose of these formulae is to better understand the impact of each term of the model\, as well as improve the speed of the calculations. We consider the SABR model (with $\beta=1$) of stochastic volatility\, which we analyze by tools from Malliavin Calculus. We follow the approach of Alòs et al (2006) who showed that under stochastic volatility framework\, the option prices can be written as the sum of the classic Hull-White (1987) term and a correction due to correlation. We derive the Hull-White term\, by using the conditional density of the average volatility\, and write it as a two-dimensional integral. For the correction part\, we use two different approaches. Both approaches rely on the pairing of the exponential formula developed by Jin\, Peng\, and Schellhorn (2016) with analytical calculations. The first approach\, which we call ”Dyson series on the return’s idiosyncratic noise” yields a complete series expansion but necessitates the calculation of a 7-dimensional integral. Two of these dimensions come from the use of Yor’s (1992) formula for the joint density of a Brownian motion and the time-integral of geometric Brownian motion. The second approach\, which we call ”Dyson series on the common noise” necessitates the calculation of only a one-dimensional integral\, but the formula is more complex. This research consisted of both analytical derivations and numerical calculations. The latter show that our formulae are in general more exact\, yet more time-consuming to calculate\, than the first order expansion of Hagan et al (2002).
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-zhengji-guo-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:20191008T121500
DTEND;TZID=America/Los_Angeles:20191008T131000
DTSTAMP:20260415T081345
CREATED:20190909T203312Z
LAST-MODIFIED:20190909T203312Z
UID:1495-1570536900-1570540200@colleges.claremont.edu
SUMMARY:Matroids: a unified theory of independence (Mauricio Gomez Lopez\, University of Oregon)
DESCRIPTION:In this talk\, I will give an overview of the theory of matroids. These are mathematical objects which capture the combinatorial essence of linear independence. Besides providing some basic definitions of this theory\, I will discuss several examples of matroids and explain some connections with optimization. Also\, in this talk\, I will introduce matroid polytopes\, which provide a geometric framework for studying matroids. If time permits\, I will discuss some new proofs to known results that I developed with one of my students during a research program this summer.
URL:https://colleges.claremont.edu/ccms/event/matroids-a-unified-theory-of-independence-mauricio-gomez-lopez-university-of-oregon/
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:20191007T163000
DTEND;TZID=America/Los_Angeles:20191007T173000
DTSTAMP:20260415T081345
CREATED:20190911T040840Z
LAST-MODIFIED:20190930T185051Z
UID:1528-1570465800-1570469400@colleges.claremont.edu
SUMMARY:Applied Math Seminar: Mathematical model of Hematopoietic cell differentiation from single-cell gene sequencing data (Prof. Heyrim Cho \,UCR)
DESCRIPTION:Recent advances in single-cell gene sequencing data and high-dimensional data analysis techniques are bringing in new opportunities in modeling biological systems. In this talk\, I will discuss different approaches to develop mathematical models from single-cell data. Particularly for high-dimensional single-cell gene sequencing data\, dimension reduction techniques are applied to find the trajectories of cell states in the reduced differentiation space. Then\, we develop PDE models that describe the cell differentiation as directed and random movement on the abstracted graph or on the reduced space. Normal hematopoiesis differentiation and abnormal processes of acute myeloid leukemia (AML) progression are simulated\, and the model can predict the emergence of cells in novel intermediate states of differentiation consistent with immunophenotypic characterizations of AML. In addition\, we demonstrate that our model is capable to illustrate the reconstitution of impaired Hematopoiesis\, for instance\, after chemotherapy.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-heyrim-cho-ucr/
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:20191004T160000
DTEND;TZID=America/Los_Angeles:20191004T170000
DTSTAMP:20260415T081345
CREATED:20190808T233920Z
LAST-MODIFIED:20190919T220053Z
UID:1353-1570204800-1570208400@colleges.claremont.edu
SUMMARY:Regime transitions of liquid films flowing down a fiber (Applied Math Talk given by Prof. Claudia Falcon\, UCLA)
DESCRIPTION:Recent  experiments  of  thin  films  flowing  down  a  vertical  fiber  with  varying  nozzle diameters present a wealth of new dynamics that illustrate the need for more advanced theory. Determining  the  regime  transitions from absolute (Rayleigh- Plateau) instability is useful in the  design  of  heat  and  mass  exchangers for applications that include cooling systems and desalination. We present a detailed analysis using a full lubrication model that includes slip boundary conditions\, nonlinear curvature terms\, and a film stabilization term. This study brings to focus the presence of a stable liquid layer playing an important role in the full dynamics. We propose a combination of these physical effects to explain the observed velocity  and  stability  of  traveling  droplets  in  the  experiments  and their  transition  to isolated droplets. When thermal gradients are present\, it can induce bead coalescence away from the nozzle. To account for this\, we incorporate spatial-dependent viscosity and surface tension to the model\, due  to  inhomogeneous  temperature  field  along  the  fiber.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-claudia-falcon/
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:20191001T121500
DTEND;TZID=America/Los_Angeles:20191001T131000
DTSTAMP:20260415T081345
CREATED:20190824T031500Z
LAST-MODIFIED:20191001T150201Z
UID:1368-1569932100-1569935400@colleges.claremont.edu
SUMMARY:Combinatorics and representation theory of Temperley-Lieb algebras (Zajj Daugherty\, CUNY)
DESCRIPTION:The classical\, one-boundary\, and two-boundary Temperley-Lieb algebras arise in mathematical physics related to solving certain rectangular lattice models.They also have beautiful presentations as “diagram algebras”\, meaning that they have basis elements depicted as certain kinds of graphs\, and multiplication rules are given by stacking diagrams and gluing of vertices. In this talk\, we will explore these algebras and their representation theory\, as well as their relationship to other important diagram algebras in combinatorial representation theory.
URL:https://colleges.claremont.edu/ccms/event/anct-seminar-zajj-daugherty-cuny/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
END:VCALENDAR