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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211103T163000
DTEND;TZID=America/Los_Angeles:20211103T173000
DTSTAMP:20260414T044253
CREATED:20211028T230900Z
LAST-MODIFIED:20211028T231026Z
UID:2450-1635957000-1635960600@colleges.claremont.edu
SUMMARY:Topological descriptions of protein folding (Prof. Helen Wong)
DESCRIPTION:Title: Topological descriptions of protein folding\nSpeaker:  Prof. Helen Wong\, Department of Mathematical Sciences\, Claremont-McKenna College. \nAbstract: Knotting in proteins was once considered exceedingly rare. However\, systematic analyses of solved protein structures over the last two decades have demonstrated the existence of many deeply knotted proteins\, and researchers now hypothesize that the knotting presents some functional or evolutionary advantage for those proteins. Unfortunately\, little is known about how proteins fold into knotted configurations. In this talk\, we approach this problem from a theoretical point of view\, using techniques from the mathematical study of shape: Topology. We’ll discuss the topological tools currently used to quantify the complexity and depth of knotting in proteins\, and compare and contrast topological descriptions of proposed pathways for proteins to form knots. \n\nHelen Wong is an Associate Professor of Mathematics in the Department of Mathematical Sciences at Claremont McKenna College and an alumna of Pomona College. Her research is in low-dimensional quantum topology\, and applications of topology to molecular biology and quantum computation. She is particularly interested in the relationship between quantum invariants and related constructions (especially the Kauffman bracket skein algebra of a surface) and non-quantum invariants from topology and hyperbolic geometry.
URL:https://colleges.claremont.edu/ccms/event/topological-descriptions-of-protein-folding-prof-helen-wong/
LOCATION:Zoom
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211108T161500
DTEND;TZID=America/Los_Angeles:20211108T171500
DTSTAMP:20260414T044253
CREATED:20210908T230638Z
LAST-MODIFIED:20211108T182044Z
UID:2317-1636388100-1636391700@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Sara Clifton (St. Olaf College)
DESCRIPTION:Title: Understanding Complex Social Systems using Minimal Mathematical Models \nAbstract: \nMinimal mathematical models are used to understand complex phenomena in the physical\, biological\, and social sciences. This modeling philosophy never claims\, nor even attempts\, to fully capture the mechanisms underlying the phenomena\, and instead offers insights and predictions not otherwise possible. Here\, we explore minimal dynamical systems models to understand several complex social phenomena\, including the profit-driven abandonment of restaurant tipping\, the public health tradeoffs of e-cigarettes\, and the progression of women through professional hierarchies. Because of their simplicity\, these models offer new connections between existing fields\, give optimal solutions with limited data\, and provide qualitative predictions of future events.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-sara-clifton-st-olaf-college/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Maryann Hohn":MAILTO:Maryann.Hohn@pomona.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211109T123000
DTEND;TZID=America/Los_Angeles:20211109T132000
DTSTAMP:20260414T044253
CREATED:20210825T201712Z
LAST-MODIFIED:20211101T172659Z
UID:2218-1636461000-1636464000@colleges.claremont.edu
SUMMARY:The Chow ring of heavy/light Hassett spaces via tropical geometry (Dagan Karp\, HMC)
DESCRIPTION:Hassett spaces in genus 0 are moduli spaces of weighted pointed stable rational curves; they are important in the minimal model program and enumerative geometry. We compute the Chow ring of heavy/light Hassett spaces. The computation involves intersection theory on the toric variety corresponding to a graphic matroid\, and rests upon the work of Cavalieri-Hampe-Markwig-Ranganathan. This is joint work with Siddarth Kannan and Shiyue Li.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-dagan-karp-hmc/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211110T163000
DTEND;TZID=America/Los_Angeles:20211110T174500
DTSTAMP:20260414T044253
CREATED:20210926T203309Z
LAST-MODIFIED:20210926T224934Z
UID:2391-1636561800-1636566300@colleges.claremont.edu
SUMMARY:Projections on Banach spaces and a lifting property of operators (Prof. Botelho)
DESCRIPTION:Title: Projections on Banach spaces and a lifting property of operators \nProf. Maria Fernanda Botelho\nDepartment of Mathematical Sciences\nThe University Of Memphis \nAbstract: In this talk I will present properties of contractive projections and explain their role in the existence of norm preserving lifts of operators. A pair of Banach spaces (X\, J)\, with J a closed subspace of X\, has the quotient lifting property (QLP) iff for every space Y and S ∈ L(Y\, X/J)\, there is Ŝ  ∈ L(Y\, X)such that S = π ◦ Ŝ\, where π denotes the quotient map from X onto X/J. This property was motivated by Lindenstrauss and Tzafriri lifting property for Banach spaces. \nA pair of Banach spaces (X\,J) has the QLP iff J is the kernel of a contractive projection on X. Several illustrative examples will be discussed. \n\n\n\n  \nBio-Sketch for Fernanda Botelho: \nI am a full professor in the Department of Mathematical Sciences at the University of Memphis. I earned a Doctor of Philosophy degree in Mathematics from the University of California at Berkeley and I did my undergraduate studies at the Universidade do Porto\, Portugal.  \nMy main research interest is in Operator Theory and Functional Analysis. I have authored and co-authored more than 80 research articles. I was a Donavant Professor in 2013-2016.  I have been the coordinator for the Mathematical Sciences Graduate Programs since 2015. \nI participated and organized several conferences\, funded by the National Sciences Foundation and in collaboration with the Association for Women in Mathematics. I have served in programs geared to high school teachers and the professional training  of graduate assistants. 
URL:https://colleges.claremont.edu/ccms/event/projections-on-banach-spaces-and-a-lifting-property-of-operators-prof-botelho/
LOCATION:Zoom
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211115T161500
DTEND;TZID=America/Los_Angeles:20211115T171500
DTSTAMP:20260414T044253
CREATED:20210908T235409Z
LAST-MODIFIED:20211112T005303Z
UID:2325-1636992900-1636996500@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Christopher Miles (UC Irvine)
DESCRIPTION:Title:  Collective motion in the mitotic spindle \nAbstract:  Math models of interacting individuals moving as a collective have been profoundly successful in describing physical and social phenomena ranging from swarming insects to human crowds. Especially in molecular biology\, recent advances in machine-learning-based automated tracking have led to droves of new data of collective motion. I’ll discuss two related projects\, both studying chromosomes (DNA) moving during mitosis (cell division). The first project will hopefully convince you that modeling this system as a collective is interesting\, exploring how collective motion models might describe how cancer cells avoid death. The second project will try to address how to actually incorporate data into the modeling process now that we have it.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-christopher-miles-uc-irvine/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211116T123000
DTEND;TZID=America/Los_Angeles:20211116T132000
DTSTAMP:20260414T044253
CREATED:20210821T181311Z
LAST-MODIFIED:20211101T170121Z
UID:2206-1637065800-1637068800@colleges.claremont.edu
SUMMARY:On sparse representation of vectors in lattices and semigroups (Iskander Aliev\, Cardiff University)
DESCRIPTION:We will discuss the sparsity of the solutions to systems of linear Diophantine equations with and without non-negativity constraints. The sparsity of a solution vector is the number of its nonzero entries\, which is referred to as the 0-norm of the vector. Our main results are new improved bounds on the minimal 0-norm of solutions to systems Ax=b\, where A is an integer matrix\, b is an integer vector and x is either a general integer vector (lattice case) or a non-negative integer vector (semigroup case). The talk is based on a joint work with G. Averkov\, J. A. De Loera and T. Oertel.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-iskander-aliev-cardiff-university/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211117T163000
DTEND;TZID=America/Los_Angeles:20211117T174500
DTSTAMP:20260414T044253
CREATED:20211103T151322Z
LAST-MODIFIED:20211109T213529Z
UID:2457-1637166600-1637171100@colleges.claremont.edu
SUMMARY:Collective Behavior in Locust Swarms from Data to Differential Equations (Prof. Jasper Weinburd)
DESCRIPTION:Title: Collective Behavior in Locust Swarms from Data to Differential Equations\n  \nProf. Jasper Weinburd\nDepartment of Mathematics\nHarvey Mudd College\n\n  \n\nAbstract: Locusts are devastating pests that infest and destroy crops. Locusts forage and migrate in large swarms which exhibit distinctive shapes that improve efficiency on the group level\, a phenomenon known as collective behavior. One of the difficulties in understanding and preventing these collective behaviors has been a lack of biological data for individual interactions between locusts.  In this talk\, I’ll first describe mathematical models for these phenomena on both the collective and individual levels. I’ll then discuss a collaboration with students at Harvey Mudd College using field data derived from video footage of locust swarms. We digitized nearly 20\,000 locust trajectories and revealed individual behaviors that depend on a locust’s motion and the relative position of its nearby neighbors. Finally\, I will illustrate the challenges and potential benefits of incorporating these field observations into our models of locust swarms.\n\n\n\n\n\nProf. Jasper Weinburd is an NSF Postdoctoral Fellow at Harvey Mudd College. He received his PhD from the University of Minnesota. In his research he uses dynamical systems\, differential equations\, and data science to model natural phenomena of self-organization. He loves hiking in the San Gabriel Mountains with his dog\, but he still hasn’t climbed Mt. Baldy.
URL:https://colleges.claremont.edu/ccms/event/collective-behavior-in-locust-swarms-using-agent-based-and-continuous-models-prof-jasper-weinburd/
LOCATION:Zoom
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211122T161500
DTEND;TZID=America/Los_Angeles:20211122T171500
DTSTAMP:20260414T044253
CREATED:20210831T001407Z
LAST-MODIFIED:20210831T001407Z
UID:2253-1637597700-1637601300@colleges.claremont.edu
SUMMARY:Thanksgiving Week
DESCRIPTION:No applied math talk
URL:https://colleges.claremont.edu/ccms/event/thanksgiving-week/
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:20211129T161500
DTEND;TZID=America/Los_Angeles:20211129T171500
DTSTAMP:20260414T044253
CREATED:20210908T234419Z
LAST-MODIFIED:20210927T040415Z
UID:2320-1638202500-1638206100@colleges.claremont.edu
SUMMARY:Applied Math Seminar - Joan Ponce (UCLA)
DESCRIPTION:Title: TBA \nAbstract: \nTBA
URL:https://colleges.claremont.edu/ccms/event/applied-mathematics-seminar-joan-ponce-ucla/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211130T123000
DTEND;TZID=America/Los_Angeles:20211130T132000
DTSTAMP:20260414T044253
CREATED:20210819T183424Z
LAST-MODIFIED:20211118T191414Z
UID:2203-1638275400-1638278400@colleges.claremont.edu
SUMMARY:Odd subgraphs are odd (Asaf Ferber\, UC Irvine)
DESCRIPTION:In this talk we discuss some problems related to finding large induced subgraphs of a given graph G which satisfy some degree-constraints (for example\, all degrees are odd\, or all degrees are j mod k\, etc). We survey some classical results\, present some interesting and challenging problems\, and sketch solutions to some of them. This is based on joint works with Michael Krivelevich\, and with Liam Hardiman and Michael Krivelevich.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-asaf-ferber-uc-irvine/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211201T163000
DTEND;TZID=America/Los_Angeles:20211201T180000
DTSTAMP:20260414T044253
CREATED:20211118T173248Z
LAST-MODIFIED:20211119T180218Z
UID:2487-1638376200-1638381600@colleges.claremont.edu
SUMMARY:A tribute to Professor Ellis Cumberbatch (1934-2021)
DESCRIPTION:Title: A tribute to Professor Ellis Cumberbatch (1934-2021) \nAbstract: The math colloquium on December 1st will be devoted to remembrances of our beloved CGU colleague Professor Ellis Cumberbatch\, a pillar of the Claremont mathematics community\, who passed away in September. Three brief talks by his friends and collaborators\, Professor John Ockendon (University of Oxford)\, Dr. Henok Abebe (Sandia National Labs)\, and Professor Asuman Aksoy (Claremont McKenna College) will be followed by informal reminiscences by any of the attendees who wish to share their stories involving Ellis. You are welcome to have your glass of wine\, beer\, or other drink so we can have a virtual toast in his memory. This zoom session will be recorded so it can be shared with those who wish to watch it later. \n \n \nCGU’s remembrance of Prof. Cumberbatch can be found here.
URL:https://colleges.claremont.edu/ccms/event/a-tribute-to-professor-ellis-cumberbatch-1934-2021/
LOCATION:Zoom
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211207T123000
DTEND;TZID=America/Los_Angeles:20211207T132000
DTSTAMP:20260414T044253
CREATED:20210907T183311Z
LAST-MODIFIED:20211130T221522Z
UID:2304-1638880200-1638883200@colleges.claremont.edu
SUMMARY:Difference sets in higher dimensions (David Conlon\, Cal Tech)
DESCRIPTION:Let d >= 2 be a natural number. We determine the minimum possible size of the difference set A-A in terms of |A| for any sufficiently large finite subset A of R^d that is not contained in a translate of a hyperplane. By a construction of Stanchescu\, this is best possible and thus resolves an old question first raised by Uhrin. Joint work with Jeck Lim.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-david-conlon-cal-tech/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211208T163000
DTEND;TZID=America/Los_Angeles:20211208T173000
DTSTAMP:20260414T044253
CREATED:20211104T163615Z
LAST-MODIFIED:20211110T164207Z
UID:2462-1638981000-1638984600@colleges.claremont.edu
SUMMARY:Where do Putnam problems come from? (Prof. Andrew Bernoff)
DESCRIPTION:Title: Where do Putnam problems come from? \nSpeaker: Andrew Bernoff\, Department of Mathematics\, Harvey Mudd College \nAbstract: The William Lowell Putnam Exam is the preeminent mathematics competition for undergraduate college students in the United States and Canada. I recently finished a three year stint on the competition’s problem committee. This talk is a personal reflection on where Putnam problems come from. I’ll discuss three problems which can loosely be described as: \n\na mathematician’s viewpoint on axe throwing\,\na model for how chickens establish a pecking order inspired by a high school math competition and a subsequent tweet by Jordan Ellenberg\, and\na covering problem that arose from a generalization of several previous Putnam problems viewed through the lens of a mathematician obsessed with the Fourier transform.\n\nI’ll close with some observations about best practices and pitfalls to avoid when constructing an exam whether it be for a class or a competition. \n\nAndrew Bernoff is a Professor of Mathematics at Harvey Mudd College. While his research concentrates on using dynamical systems methods to understand experiments and natural phenomena\, he has a longstanding interest in recreational mathematics and problem solving. As an undergraduate at MIT he ran the first Integration Bee\, a tradition that has now continued for over four decades. More recently he just finished a three year stint on the William Lowell Putnam Exam’s problem committee.
URL:https://colleges.claremont.edu/ccms/event/where-do-putnam-problems-come-from-prof-andrew-bernoff/
LOCATION:CA
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220125T123000
DTEND;TZID=America/Los_Angeles:20220125T132000
DTSTAMP:20260414T044253
CREATED:20210907T183748Z
LAST-MODIFIED:20220119T170851Z
UID:2308-1643113800-1643116800@colleges.claremont.edu
SUMMARY:Questions on Symmetric Chains (Shahriar Shahriari\, Pomona)
DESCRIPTION:The set of subsets {1\, 3}\, {1\, 3\, 4}\, {1\, 3\, 4\, 6} is a symmetric chain in the partially ordered set (poset) of subsets of {1\,…\,6}. It is a chain\, because each of the subsets is a subset of the next one. It is symmetric because the collection has as many subsets with less than 3 elements as it has subsets with more than 3 elements (3 is half of 6\, the size of the original set). It is straightforward to partition the set of all subsets of {1\,…\,6} into symmetric chains. Such a partition is called a symmetric chain decomposition of the poset. We are interested in the following—admittedly curious sounding—question. What is the maximum integer k\, such that given any collection of k disjoint symmetric chains in the poset of subsets of a finite set\, we can enlarge the collection to a symmetric chain decomposition of the poset? I don’t know the answer\, but in this talk\, I will discuss a special case\, a number of related results and questions\, and provide some background on why symmetric chain decompositions are useful.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-shahriar-shahriari-pomona/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220126T161500
DTEND;TZID=America/Los_Angeles:20220126T173000
DTSTAMP:20260414T044253
CREATED:20220121T013826Z
LAST-MODIFIED:20220121T212036Z
UID:2550-1643213700-1643218200@colleges.claremont.edu
SUMMARY:Using Stitching for faster sampling (Prof. Mark Huber)
DESCRIPTION:Title: Using Stitching for faster sampling \nSpeaker: Mark Huber\, Department of Mathematics\, Claremont McKenna College \nAbstract: Point processes are used to model location data\, such as the locations of trees in a forest\, or cities in a plain.  Repulsive point processes modify the basic model in order to obtain points that are farther apart from each other than would be expected if they were placed uniformly at random.  In order to understand the behavior of these models\, Monte Carlo methods are used\, which draw samples from the probabilistic model.  In this talk\, I’ll show how to draw from a particular example of a repulsive point process called the Strauss process for parameters that were never possible before.  The method is called stitching\, and is a type of divide-and-conquer algorithm that is surprisingly effective for these types of problems. \n\nHuber got his start in data science (before it was called that) at HMC (’94).  He then headed to Cornell and obtained his Ph.D. from the Operations Research and Industrial Engineering department.  After a postdoc at Stanford and a position at Duke\, he returned to the West Coast and is now the Fletcher Jones Foundation Professor of Mathematics and Statistics and George R. Roberts Fellow\, and the Program Director of Data Science and Computer Science at Claremont McKenna.  His third book\, “Probability Adventures”\, is now available.
URL:https://colleges.claremont.edu/ccms/event/using-stitching-for-faster-sampling-prof-mark-huber/
LOCATION:CA
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220131T161500
DTEND;TZID=America/Los_Angeles:20220131T171500
DTSTAMP:20260414T044253
CREATED:20220116T203846Z
LAST-MODIFIED:20220118T032454Z
UID:2533-1643645700-1643649300@colleges.claremont.edu
SUMMARY:APPLIED MATH SEMINAR: Archetypal analysis by Professor Braxton Osting (University of Utah)
DESCRIPTION:Archetypal analysis is an unsupervised learning method that uses a convex polytope to summarize multivariate data. For fixed k\, the method finds a convex polytope with k vertices\, called archetype points\, such that the polytope is contained in the convex hull of the data and the mean squared distance between the data and the polytope is minimal. In this talk\, I’ll give an overview of the method and discuss connections to matrix factorization\, SVD/PCA\, and the k-means clustering method. I’ll discuss our recent results proving the consistency of archetypal analysis and describe probabilistic methods for approximate archetypal analysis. This is joint work with Ruijian Han\, Dong Wang\, Yiming Xu\, and Dominique Zosso.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-braxton-osting-university-of-utah/
LOCATION:CA
CATEGORIES:Applied Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220201T123000
DTEND;TZID=America/Los_Angeles:20220201T132000
DTSTAMP:20260414T044253
CREATED:20220121T001428Z
LAST-MODIFIED:20220126T183034Z
UID:2543-1643718600-1643721600@colleges.claremont.edu
SUMMARY:Niho's last conjecture (Daniel Katz\, Cal State Northridge)
DESCRIPTION:A power permutation of a finite field F is a permutation of F whose functional form is x -> x^d for some exponent d.  Power permutations are used in cryptography\, and the exponent d must be chosen so that the permutation is highly nonlinear\, that is\, not easily approximated by linear functions.  The Walsh spectrum of a power permutation is a list of numbers measuring the correlation of our power permutation with the various linear functions. The last conjecture in Niho’s 1972 thesis considers a particular infinite family of highly nonlinear power permutations\, and states that each permutation in this family has a Walsh spectrum with at most five distinct values. Niho’s own techniques show that there are at most eight distinct values. Each of the eight candidate values corresponds to a possible number of distinct roots of a seventh degree polynomial on a subset of the finite field F called the unit circle. We use symmetry arguments to show that it is impossible to have four\, six\, or seven roots on the unit circle: this proves Niho’s last conjecture. This is joint work with Tor Helleseth and Chunlei Li.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-daniel-katz-cal-state-northridge/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220202T161500
DTEND;TZID=America/Los_Angeles:20220202T173000
DTSTAMP:20260414T044253
CREATED:20220128T183638Z
LAST-MODIFIED:20220131T193506Z
UID:2581-1643818500-1643823000@colleges.claremont.edu
SUMMARY:Exploiting metric structure for more accurate classification (Prof. Mike Izbicki)
DESCRIPTION:Title: Exploiting metric structure for more accurate classification \nSpeaker: Mike Izbicki\, Department of Mathematical Sciences\, Claremont McKenna College \nAbstract: Classification problems often have many semantically similar classes.  For example\, the famous ImageNet dataset contains classes for 80 different dog breeds\, 40 different bird species\, and 25 types of vehicles.  This semantic structure can be formalized using a metric space\, with semantic similarity of classes encoded by the distance function.  In this talk\, I’ll describe the “tree loss”\, which is the first technique with provable performance guarantees for exploiting this metric structure.  I’ll also show that the tree loss has better empirical performance than competing algorithms on image\, text\, and vector data. \n\nMike studies machine learning theory\, focusing on applications to natural language and social media.  He has been at CMC for 3 years now\, where he teaches computer and data science classes.  Prior to his academic career\, Mike spent 7 years in the US Navy.  Highlights include converting >10g of Uranium into pure energy as a nuclear submarine officer\, and doing [redacted] for the NSA.  After leaving the navy\, Mike went to North Korea to teach computer science as part of an academic exchange program designed to improve relations between the US and North Korea.  He earned his phd from UC Riverside.
URL:https://colleges.claremont.edu/ccms/event/exploiting-metric-structure-for-more-accurate-classification-prof-mike-izbicki/
LOCATION:Zoom meeting\, United States
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220207T161500
DTEND;TZID=America/Los_Angeles:20220207T171500
DTSTAMP:20260414T044253
CREATED:20220125T183035Z
LAST-MODIFIED:20220201T005247Z
UID:2565-1644250500-1644254100@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Yunied Puig de Dios (CMC)
DESCRIPTION:Title: Modern techniques to approach the invariant subspace problem \nAbstract:  The invariant subspace problem is by far one of the most important problems in operator theory. It has been open for more than half a century\, and there are many significant contributions with a huge variety of techniques\, making this challenging problem so interesting; however the solution seems to be nowhere in sight. In this talk we are going to present a technique born in the 90’s and developed in the last two decades that has contributed tremendously to approach the invariant subspace problem\, becoming a very popular branch of operator theory and functional analysis\, called linear dynamics.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-yunied-puig-de-dios-cmc/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220208T123000
DTEND;TZID=America/Los_Angeles:20220208T132000
DTSTAMP:20260414T044253
CREATED:20220131T003643Z
LAST-MODIFIED:20220131T003643Z
UID:2585-1644323400-1644326400@colleges.claremont.edu
SUMMARY:Frame coherence and nearly orthogonal lattices (Lenny Fukshansky\, CMC)
DESCRIPTION:A frame in a Euclidean space is a spanning set\, which can be overdetermined. Large frames are used for redundant signal transmission\, which allows for error correction. An important parameter of frames is coherence\, which is maximal absolute value of the cosine of the angle between two frame vectors: the smaller it is\, the closer is the frame to being orthogonal\, which minimizes noise from overlapping frequencies in transmission. One good source frames with sufficiently low coherence comes from layers of minimal vectors in a lattice. We will discuss a particular class of so-called nearly orthogonal lattices\, which exhibits some interesting properties from the stand-point of coherence and other related optimization problems. This is joint work with David Kogan (CGU).
URL:https://colleges.claremont.edu/ccms/event/frame-coherence-and-nearly-orthogonal-lattices-lenny-fukshansky-cmc/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220208T150000
DTEND;TZID=America/Los_Angeles:20220208T160000
DTSTAMP:20260414T044253
CREATED:20230913T074942Z
LAST-MODIFIED:20230913T074942Z
UID:3223-1644332400-1644336000@colleges.claremont.edu
SUMMARY:Experimental Knot Music v2 (Sam Nelson\, CMC)
DESCRIPTION:In this talk I will recount the history of my knot theory-based music project and show an example of my method for creating music from knot homsets.
URL:https://colleges.claremont.edu/ccms/event/experimental-knot-music-v2-sam-nelson-cmc/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220209T161500
DTEND;TZID=America/Los_Angeles:20220209T173000
DTSTAMP:20260414T044253
CREATED:20220131T170105Z
LAST-MODIFIED:20220131T170634Z
UID:2588-1644423300-1644427800@colleges.claremont.edu
SUMMARY:Modeling the waning and boosting of immunity (Prof. Lauren Childs)
DESCRIPTION:Title: Modeling the waning and boosting of immunity\n\n\nSpeaker: Dr. Lauren Childs\nAssistant Professor and the Cliff and Agnes Lilly Faculty Fellow\nVirgina Tech\n\n \nAbstract: Infectious disease often leads to significant loss of life and burden on society. Understanding disease dynamics is essential to the development and implementation of earlier and more effective interventions. Traditionally\, perfect\, long-lasting protection against disease is assumed to be acquired\, but this need not always be the case. Immunity following natural infection (or immunization) may wane\, increasing susceptibility with time since exposure. In this talk\, we begin by examining a classic model of waning and boosting immunity with a focus on the bifurcation structure and how it changes as reinfection is considered. Then\, we discuss an extension of this framework with an age- and immune status-dependent model of disease transmission. In this model\, susceptibility\, infectiousness\, and symptom severity all vary with immune status\, while age affects contacts and vaccination.  We examine applications of this model to two diseases: pertussis\, commonly known as whooping cough\, and COVID-19. For pertussis\, we examine age-specific incidence and prevalence and find vaccination leads to a resurgence of immunity-modified pertussis in older children\, as observed with effective vaccination programs. For COVID-19\, we examine the role of waning and boosting immunity to estimate seroprevalence in Canada and to evaluate vaccination strategies. We find a large fraction of the Canadian population with some immunity following infection or vaccination\, but that the quality and longevity of this immunity decreases with time. Using contact and demographic data from specific locations coupled with disease-specific parameterization\, our model has the potential to assist in the development and optimization of vaccination schedules. This is important to mitigate resurgence of immunity-modified disease due to natural boosting.\n\n\nDr. Lauren Childs is an Assistant Professor in the Department of Mathematics and the Cliff and Agnes Lilly Faculty Fellow in the College of Science at Virginia Tech. Her research focuses on developing and analyzing mathematical and computational models for a better understanding of the dynamics of infectious diseases\, in particular vector-borne diseases such as malaria. Her research emphasizes the interactions within a host organism\, such as between an invading pathogen and the immune response\, and the impacts of such interactions on transmission between individuals in the population.
URL:https://colleges.claremont.edu/ccms/event/modeling-the-waning-and-boosting-of-immunity-prof-lauren-childs/
LOCATION:Zoom
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220214T161500
DTEND;TZID=America/Los_Angeles:20220214T171500
DTSTAMP:20260414T044253
CREATED:20220125T182526Z
LAST-MODIFIED:20220125T182526Z
UID:2560-1644855300-1644858900@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Project Pitch Day
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-project-pitch-day/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220215T123000
DTEND;TZID=America/Los_Angeles:20220215T132000
DTSTAMP:20260414T044253
CREATED:20220119T153839Z
LAST-MODIFIED:20220210T023821Z
UID:2540-1644928200-1644931200@colleges.claremont.edu
SUMMARY:Recent trends in using representations in voting theory - committees and cyclic orders (Karl-Dieter Crisman\, Gordon College)
DESCRIPTION:One of the most important axioms in analyzing voting systems is that of “neutrality”\, which stipulates that the system should treat all candidates symmetrically. Even though this doesn’t always directly apply (such as in primary systems or those with intentional incumbent protection)\, it is extremely important both in theory and practice.If the voting systems in question additionally are tabulated using some sort of points\, we can translate the notion of neutrality into invariance under an action of the symmetric group on a vector space. This means we can exploit representation theory to analyze them\, and this has been successfully done in a number of social choice contexts from cooperative games to voting on full rankings.In this talk\, we describe recent progress in extending this technique to two interesting situations. First we consider work of Barcelo et al. on voting for committees of representatives (such as for departments in a college)\, where the wreath product of two symmetric groups comes into play. Then we look at work by Crisman et al. regarding voting on “cyclic orders”\, or ways to seat people around a table\, which implicitly has both left and right actions of the symmetric group to consider.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-karl-dieter-crisman-gordon-college/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220215T150000
DTEND;TZID=America/Los_Angeles:20220215T160000
DTSTAMP:20260414T044253
CREATED:20230913T075335Z
LAST-MODIFIED:20230913T075335Z
UID:3225-1644937200-1644940800@colleges.claremont.edu
SUMMARY:On Invariants for Surface-Links in Entropic Magmas via Marked Graph Diagrams (Seonmi Choi\, Kyungpook Natl U\, Korea)
DESCRIPTION:M. Niebrzydowski and J. H. Przytycki defined a Kauffman bracket magma and constructed the invariant P of framed links in 3-space. The invariant is closely related to the Kauffman bracket polynomial. The normalized bracket polynomial is obtained from the Kauffman bracket polynomial by the multiplication of indeterminate and it is an ambient isotopy invariant for links. In this talk\, we reformulate the multiplication by using a map from the set of framed links to a Kauffman bracket magma in order that P is invariant for links in 3-space. We define a generalization of a Kauffman bracket magma\, which is called a marked Kauffman bracket magma. We find the conditions to be invariant under Yoshikawa moves except the first one and use a map from the set of admissible marked graph diagrams to a marked Kauffman bracket magma to obtain the invariant for surface-links in 4-space.
URL:https://colleges.claremont.edu/ccms/event/on-invariants-for-surface-links-in-entropic-magmas-via-marked-graph-diagrams-seonmi-choi-kyungpook-natl-u-korea/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220216T161500
DTEND;TZID=America/Los_Angeles:20220216T173000
DTSTAMP:20260414T044253
CREATED:20220128T164956Z
LAST-MODIFIED:20220214T180454Z
UID:2577-1645028100-1645032600@colleges.claremont.edu
SUMMARY:Solving the Race in Backgammon (Prof. Arthur Benjamin)
DESCRIPTION:Title: Solving the Race in Backgammon\n \nSpeaker: Prof. Arthur Benjamin\nSmallwood Family Professor of Mathematics\nHarvey Mudd College\n \nAbstract: Backgammon is perhaps the oldest game that is still played today. It is a game that combines luck with skill\, where two players take turns rolling dice and decide how to move their checkers in the best possible way. It is the ultimate math game\, where players who possess a little bit of mathematical knowledge can have a big advantage over their opponents.  Players also have the opportunity to double the stakes of a game using something called the doubling cube\, which—when used optimally—leads to players winning more in the long run. Optimal use of the doubling cube relies on a player’s ability to estimate their winning chances at any stage of the game.\n\nWhen played to completion\, every game of backgammon eventually becomes a race\, where each player attempts to remove all of their checkers before their opponent does. The goal of our research is to be able to determine the optimal doubling cube action for any racing position\, and approximate the game winning chances for both sides. By calculating the Effective Pip Count for both players and identifying the positions’ Variance Types\, we arrive at a reasonably simple method for achieving this which is demonstrably superior to other popular methods.\n\n\n\n\nArthur Benjamin\, PhD\, Smallwood Family Professor of Mathematics\, is recognized nationally for his ability to perform rapid mental calculations. In 2020 he won the inaugural American Backgammon Tour Online (ABTO) with the best overall performance in a series of 17 national tournaments.  He has published several books on how to make math both fun and easy.  He is also a professional mathemagician and frequently performs at the Magic Castle in Hollywood and nationwide.
URL:https://colleges.claremont.edu/ccms/event/solving-the-race-in-backgammon-prof-arthur-benjamin/
LOCATION:Zoom meeting\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220223T161500
DTEND;TZID=America/Los_Angeles:20220223T173000
DTSTAMP:20260414T044253
CREATED:20220216T183109Z
LAST-MODIFIED:20220217T003329Z
UID:2626-1645632900-1645637400@colleges.claremont.edu
SUMMARY:Modeling  Zoonotic Infectious Diseases from Wildlife to Humans (Prof. Linda J. S. Allen)
DESCRIPTION:Title: Modeling  Zoonotic Infectious Diseases from Wildlife to Humans \nSpeaker: Prof. Linda J. S. Allen\, P. W. Horn Distinguished Professor Emeritus Texas Tech University \nAbstract: Zoonotic infectious diseases are diseases transmitted from animals to humans. It is estimated that over 60% of human infectious diseases are zoonotic. The Centers for Disease Control and Prevention has identified eight priority zoonoses in the US. Three of the priority zoonoses are avian influenza\, Lyme disease\, and emerging coronaviruses. Spillover of infections from animals to humans depends on a complex pathway from the natural wildlife reservoir.  The natural reservoir for avian influenza virus is wild birds but it is spread to humans from infected chickens. The natural reservoir for the bacterial pathogen causing Lyme disease is mice but it is transmitted to humans through the bite of an infected tick vector.    In this presentation\, we discuss a few of the modeling efforts to better understand the spread of infection in the natural reservoir and the spillover to humans as well as the impacts of demographic and environmental variability on timing of spillover.  \n___________________________________________________________________________________________________ \nLinda J. S. Allen received her PhD in Mathematics from University of Tennessee and was a Professor of Mathematics at Texas Tech University until 2019.  She is currently an Adjunct  Graduate Faculty at Texas Tech University. Her research interests are in mathematical ecology\, epidemiology\, and immunology.\nhttps://www.math.ttu.edu/~lallen/\nhttps://www.depts.ttu.edu/provost/scholars/lindaallen.php\n\nResearch Experiences for Undergraduates at Texas Tech University “Mathematical\, Statistical\, and Computational Methods for Problems in the Life Sciences”\n June 6-July 20\, 2022\n\nREU Applications Due: March 6\, 2022:\nhttps://www.math.ttu.edu/undergraduate/reu2022/
URL:https://colleges.claremont.edu/ccms/event/modeling-zoonotic-infectious-diseases-from-wildlife-to-humans-prof-linda-j-s-allen/
LOCATION:Zoom meeting\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220228T161500
DTEND;TZID=America/Los_Angeles:20220228T171500
DTSTAMP:20260414T044253
CREATED:20220125T180406Z
LAST-MODIFIED:20220317T190247Z
UID:2558-1646064900-1646068500@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Illia Karabash (IAMM of NAS of Ukraine and TU Dortmund)
DESCRIPTION:Title: Pareto optimization of resonances and optimal control methods \nAbstract: \nFirst successes in fabrication of high-Q optical cavities two decades ago led to active applied physics and numerical studies of optimization problems involving resonances. The questions is how to design an open resonator that has an eigenvalue as close as possible to the real line under certain constraints. The analytic spectral optimization theory for such types of non-Hermitian eigenproblems is still in the stage of development. It is planned to explain briefly why the Pareto optimization settings are natural for non-Hermitian spectral problems\, and how the associated nonlinear Euler-Lagrange eigenproblems can be rigorously derived for the case of resonances in 1-d photonic crystals. Then we concentrate on the recently developed optimal control approach of (Karabash\, Koch\, Verbytskyi `20) and show how it is related to Pareto frontiers and Hamilton-Jacobi-Bellman PDEs. An application of Pontryagin Maximum Principle and a special method of minimum-time shooting to a line of no-return will be also discussed.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-illia-karabash-tu-dortmund/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220301T123000
DTEND;TZID=America/Los_Angeles:20220301T132000
DTSTAMP:20260414T044253
CREATED:20220111T231348Z
LAST-MODIFIED:20220221T211055Z
UID:2524-1646137800-1646140800@colleges.claremont.edu
SUMMARY:Gap theorems for linear forms and for rotations on higher dimensional tori (Alan Haynes\, University of Houston)
DESCRIPTION:This talk is based on joint work with Jens Marklof\, and with Roland Roeder. The three distance theorem states that\, if x is any real number and N is any positive integer\, the points x\, 2x\, … \, Nx modulo 1 partition the unit interval into component intervals having at most 3 distinct lengths. We will present two higher dimensional analogues of this problem. In the first we consider points of the form mx+ny modulo 1\, where x and y are real numbers and m and n are integers taken from an expanding set in the plane. This version of the problem was previously studied by Geelen and Simpson\, Chevallier\, Erdős\, and many other people\, and it is closely related to the Littlewood conjecture in Diophantine approximation. The second version of the problem is a straightforward generalization to rotations on higher dimensional tori which\, surprisingly\, has been mostly overlooked in the literature. For the two dimensional torus\, we are able to prove a five distance theorem\, which is best possible. In higher dimensions we also have bounds\, but establishing optimal bounds is an open problem.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-alan-haynes-university-of-houston/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220301T150000
DTEND;TZID=America/Los_Angeles:20220301T160000
DTSTAMP:20260414T044253
CREATED:20230913T075541Z
LAST-MODIFIED:20230913T075541Z
UID:3226-1646146800-1646150400@colleges.claremont.edu
SUMMARY:Two-Bridge Knots Admit no Purely Cosmetic Surgeries (Thomas Mattman\, California State University\, Chico)
DESCRIPTION:(Joint with Ichihara\, Jong\, and Saito). We show that two-bridge knots admit no purely cosmetic surgeries\, ie no pair of distinct Dehn surgeries on such a knot produce 3-manifolds that are homeomorphic as oriented manifolds. Our argument is based on a recent result by Hanselman and a study of signature and finite type invariants of knots as well as the SL(2\,\C) Casson invariant.
URL:https://colleges.claremont.edu/ccms/event/two-bridge-knots-admit-no-purely-cosmetic-surgeries-thomas-mattman-california-state-university-chico/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
END:VCALENDAR