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:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260126T160000
DTEND;TZID=America/Los_Angeles:20260126T170000
DTSTAMP:20260409T213947
CREATED:20260121T185658Z
LAST-MODIFIED:20260121T185658Z
UID:3967-1769443200-1769446800@colleges.claremont.edu
SUMMARY:Fractional Brownian Motion: Small Increments and First Exit Time from One-sided Barrier (Qidi Peng\, CGU)
DESCRIPTION:Abstract: The talk introduces a conjecture on the first exit time of fractional Brownian motion: the upper-tail probability for a fractional Brownian motion to first exit a positive-valued barrier over time T has the exact asymptotic rate T^(H-1)\, where H is the Hurst parameter of the fractional Brownian motion. The talk tries to understand this conjecture by providing several equivalent statements. We then introduce the best effort made in the current literature towards solving this conjecture.
URL:https://colleges.claremont.edu/ccms/event/fractional-brownian-motion-small-increments-and-first-exit-time-from-one-sided-barrier-qidi-peng-cgu/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Ryan Aschoff":MAILTO:ryan.aschoff@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260127T121500
DTEND;TZID=America/Los_Angeles:20260127T131000
DTSTAMP:20260409T213947
CREATED:20260106T213106Z
LAST-MODIFIED:20260106T233659Z
UID:3942-1769516100-1769519400@colleges.claremont.edu
SUMMARY:The forbidden quiver of a link (Sam Nelson\, CMC)
DESCRIPTION:Virtual links can be represented as equivalence classes of Gauss diagrams under Reidemeister moves. The Forbidden Moves are moves which look plausible but change the virtual isotopy class of the knot or link — indeed\, virtual knots are all trivial if we allow forbidden moves. However\, virtual links remain non-trivial. In this talk we show how to think of these links as quivers and in the process\, define several polynomial invariants of link homotopy. This is joint work with Stella Shah (Scripps College).
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-sam-nelson-cmc-4/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260129T161500
DTEND;TZID=America/Los_Angeles:20260129T171500
DTSTAMP:20260409T213947
CREATED:20260129T221950Z
LAST-MODIFIED:20260129T222543Z
UID:3979-1769703300-1769706900@colleges.claremont.edu
SUMMARY:Sampling from the proper colorings of a graph using a number of colors linear in the maximum degree in expected linear time (Mark Huber\, CMC)
DESCRIPTION:Abstract: A proper coloring of a graph is an assignment of colors from \( \{1\, 2\, \ldots\, k\} \) to each node of a graph such that no two nodes connected by an edge receive the same color. Let \( \Delta \) denote the maximum degree of the graph. If \( k \geq \Delta + 1 \) then at least one proper coloring always exists. However\, counting the number of proper colorings of an arbitrary graph is a #P-complete problem\, even when \( \Delta = 3 \). This means finding a polynomial time exact algorithm is unlikely to be found. On the other hand\, if a user can sample uniformly at random from the proper colorings of a graph\, then it becomes possible to approximately count the number of proper colorings to arbitrary precision in polynomial time. This work presents the first algorithm that has an expected running time that is linear in the size of the graph under the condition that \( k > 3.637 \Delta \). Joint work with Kritika Bhandari.
URL:https://colleges.claremont.edu/ccms/event/sampling-from-the-proper-colorings-of-a-graph-using-a-number-of-colors-linear-in-the-maximum-degree-in-expected-linear-time-mark-huber-cmc/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Ryan Aschoff":MAILTO:ryan.aschoff@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260130T110000
DTEND;TZID=America/Los_Angeles:20260130T121500
DTSTAMP:20260409T213947
CREATED:20260110T204139Z
LAST-MODIFIED:20260127T020408Z
UID:3944-1769770800-1769775300@colleges.claremont.edu
SUMMARY:CCMS Colloquium: John Baez (UCR)
DESCRIPTION:CCMS Colloquium invites you to a talk by John Baez (UCR)\n\n \nTitle: The mathematics of tuning systems\n \nAbstract: Leibniz said “Music is the pleasure the human mind experiences from counting without being aware that it is counting.”  The first step is choosing a tuning system — the frequency ratios between pitches in a scale.  Different kinds of music sound best in different tuning systems!  In music from the Middle Ages until today\, new musical styles have gone hand in hand with mathematical innovations in tuning systems.  Here I will focus on a few of the most important and beautiful Western systems\, from Pythagorean tuning to today’s reigning champion: equal temperament. Can you hear the difference?  What will come next?\n \n  \nBio:   \nJohn Baez is a mathematical physicist\, formerly at U. C. Riverside and currently the Maxwell Fellow at the University of Edinburgh.   He is known for the Cobordism Hypothesis connecting manifolds to higher categories.  In 1993 he began writing This Week’s Finds in Mathematical Physics\, which has been called the world’s first blog.   Since then he has helped start two well-known blogs: The n-Category Caf e\, a group blog on math and physics\, and Azimuth\, on mathematics and ecological issues.   He also writes a regular column in Notices of the American Mathematical Society.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-john-baez-ucr/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
END:VCALENDAR