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:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240930T161500
DTEND;TZID=America/Los_Angeles:20240930T171500
DTSTAMP:20260505T090102
CREATED:20240924T160708Z
LAST-MODIFIED:20240924T162100Z
UID:3537-1727712900-1727716500@colleges.claremont.edu
SUMMARY:Applied Math Seminar: Sarah Marzen (Department of Natural Science)
DESCRIPTION:Title: How well do neurons\, humans\, and artificial neural networks predict? \nAbstract: Sensory prediction is thought to be vital to organisms\, but few studies have tested how well organisms and parts of organisms efficiently predict their sensory input in an information-theoretic sense.  In this talk\, we report results on how well cultured neurons (“brain in a dish”) and humans efficiently predict artificial stimuli. We find that both are efficient predictors of their artificial input.  That leads to the question of why\, and to answer this\, we study artificial neural networks\, finding that LSTMs show similarly efficient prediction but do not model how humans learn well.  Instead\, it appears that an existing model of cultured neurons and a model of humans as order-R Markov modelers explain their performance on these prediction tasks.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-sarah-marzen-department-of-natural-science/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20241001T121500
DTEND;TZID=America/Los_Angeles:20241001T131000
DTSTAMP:20260505T090102
CREATED:20240827T194511Z
LAST-MODIFIED:20241001T153641Z
UID:3473-1727784900-1727788200@colleges.claremont.edu
SUMMARY:Adinkras as Origami? (Edray Goins\, Pomona College)
DESCRIPTION:Around 20 years ago\, physicists Michael Faux and Jim Gates invented Adinkras as a way to better understand Supersymmetry.  These are bipartite graphs whose vertices represent bosons and fermions and whose edges represent operators which relate the particles.  Recently\, Charles Doran\, Kevin Iga\, Jordan Kostiuk\, Greg Landweber and Stefan M\'{e}ndez-Diez determined that Adinkras are a type of Dessin d’Enfant; they showed this by explicitly exhibiting a Belyi map as a composition $\beta: S \to \mathbb P^1(\mathbb C) \to \mathbb P^1(\mathbb C)$.  They computed the first arrow as a map from a certain compact connected Riemann surface $S$ to the Riemann sphere $\mathbb P^1(\mathbb C) \simeq S^2(\mathbb R)$\, and the second as a map which keeps track of the “coloring” of the edges.\n\nAdinkras naturally have square faces.  This keeps track of the non-commutative nature of the supersymmetric operators.  While Dessin d’Enfants correspond to triangular tilings of Riemann surfaces\, there is a similar construction — called “origami” — which correspond to square tilings.  In this project\, we attempt to discover how to express the construction of Doran\, et al. as a composition $\beta: S \to E(\mathbb C) \to \mathbb P^1(\mathbb C)$ for some elliptic curve elliptic curve $E$ such that the map corresponds to an “origami”\, that is\, a map which is branched over just one point.  This work is conducted as part of the Pomona Research in Mathematics Experience (DMS-2113782).
URL:https://colleges.claremont.edu/ccms/event/adinkras-as-origami-edray-goins-pomona-college/
LOCATION:Estella 2113
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20241001T150000
DTEND;TZID=America/Los_Angeles:20241001T160000
DTSTAMP:20260505T090102
CREATED:20240928T044059Z
LAST-MODIFIED:20240928T044059Z
UID:3549-1727794800-1727798400@colleges.claremont.edu
SUMMARY:Claremont Topology Seminar: Reginald Anderson (CMC)
DESCRIPTION:We welcome all undergraduate/graduate students and faculty to attend topology seminar! \nSpeaker: Reginald Anderson (CMC) \nTitle: Presentations of derived categories \nAbstract: A modification of the cellular resolution of the diagonal given by Bayer-Popescu-Sturmfels gives a virtual resolution of the diagonal for smooth projective toric varieties and toric Deligne-Mumford stacks which are a global quotient of a smooth projective variety by a finite abelian group. In the past year\, Hanlon-Hicks-Lazarev gave a minimal resolution of the diagonal for toric subvarieties of smooth projective toric varieties. We give implications for exceptional collections on smooth projective toric Fano varieties in dimensions 1-4. This is joint work with CMC undergrads Justin Son\, Hill Zhang\, and Jumari Querimit-Ramirez.
URL:https://colleges.claremont.edu/ccms/event/claremont-topology-seminar-reginald-anderson-cmc-3/
LOCATION:Estella 2099
CATEGORIES:Topology Seminar
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20241002T160000
DTEND;TZID=America/Los_Angeles:20241002T173000
DTSTAMP:20260505T090102
CREATED:20240929T210415Z
LAST-MODIFIED:20240929T210437Z
UID:3558-1727884800-1727890200@colleges.claremont.edu
SUMMARY:No CCMS Colloquium on October 2nd!
DESCRIPTION:We will see you all next week!
URL:https://colleges.claremont.edu/ccms/event/no-ccms-colloquium-on-october-2nd/
LOCATION:CA
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20241003T163000
DTEND;TZID=America/Los_Angeles:20241003T173000
DTSTAMP:20260505T090102
CREATED:20240917T032244Z
LAST-MODIFIED:20240923T201847Z
UID:3514-1727973000-1727976600@colleges.claremont.edu
SUMMARY:Analysis seminar: Stephan Ramon Garcia (Pomona College)
DESCRIPTION:Title: What can chicken McNuggets tell us about symmetric functions\, positive polynomials\, random norms\, and AF algebras? \nAbstract: Numerical semigroups are combinatorial objects that lead to deep and subtle questions. With tools from complex\, harmonic\, and functional analysis\, probability theory\, algebraic combinatorics\, and computer-aided design\, we answer virtually all asymptotic questions about factorization lengths in numerical semigroups. Our results yield uncannily accurate predictions\, along with unexpected results about symmetric functions\, trace polynomials\, and the statistical properties of certain AF C∗-algebras. \nWork partially supported by NSF Grants DMS-1800123 and DMS-2054002. Joint work (in various combinations) with K. Aguilar\, A. Böttcher\, L. Bouthat\, Á. Chávez\, L. Fukshansky\, M. Mitkovski\, M. Omar\, C. O’Neill\, J. Volčič and students A. Chhabra\, J. Hurley\, G. Udell\, T. Wesley\, and S. Yih.
URL:https://colleges.claremont.edu/ccms/event/analysis-seminar-stephan-ramon-garcia-pomona-college/
LOCATION:Estella 2131\, Pomona College\, 610 N College Ave\, Claremont\, 91711\, United States
CATEGORIES:Analysis Seminar
ORGANIZER;CN="Asuman Aksoy":MAILTO:asuman.aksoy@claremontmckenna.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20241005T100000
DTEND;TZID=America/Los_Angeles:20241005T120000
DTSTAMP:20260505T090102
CREATED:20240917T222009Z
LAST-MODIFIED:20240927T004326Z
UID:3519-1728122400-1728129600@colleges.claremont.edu
SUMMARY:GEMS October 5th Session
DESCRIPTION:Title:  How to use coins to make a 7-sided die\n\nAbstract:  Certain dice are easier to make than others.  There is the standard 6-sided die\, but 4-sided\, 8-sided\, 10-sided\, 12-sided\, and 20-sided are also very common.  What isn’t so common is a 7-sided die.  Here Dr. Mark Huber from Claremont McKenna College will talk about how you can simulate a roll of a 7-sided die using only flips of a fair coin.  This works because of something called the Fundamental Theorem of Perfect Simulation\, which allows us to break down simulation problems into smaller problems.
URL:https://colleges.claremont.edu/ccms/event/gems-october-5th-session/
LOCATION:Harvey Mudd College at the Shanahan Teaching and Learning Center\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:GEMS
END:VEVENT
END:VCALENDAR