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: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 END:VTIMEZONE BEGIN:VEVENT DTSTART;TZID=America/Los_Angeles:20190910T121500 DTEND;TZID=America/Los_Angeles:20190910T131000 DTSTAMP:20260419T120023 CREATED:20190522T000934Z LAST-MODIFIED:20190909T032954Z UID:1333-1568117700-1568121000@colleges.claremont.edu SUMMARY:Frobenius problem over number fields (Lenny Fukshansky\, CMC) DESCRIPTION:The classical Frobenius problem asks for the largest integer not representable as a non-negative integer linear combination of a relatively prime integer n-tuple. This problem and its various generalizations have been studied extensively in combinatorics\, number theory\, algebra\, theoretical computer science and probability theory. In this talk\, we will consider a reformulation of this problem in the context of number fields\, which leads to some arithmetic questions about semigroups of algebraic integers and height functions. This is joint work with CMC student Edward Shi. URL:https://colleges.claremont.edu/ccms/event/antc-seminar-mauricio-gomez-lopez-univ-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:20190917T121500 DTEND;TZID=America/Los_Angeles:20190917T131000 DTSTAMP:20260419T120023 CREATED:20190910T234527Z LAST-MODIFIED:20190912T055110Z UID:1520-1568722500-1568725800@colleges.claremont.edu SUMMARY:Introduction to theory of Euclid graphs (Sin-Min Lee\, SJSU) DESCRIPTION:In Euclidean geometry\, the sum of  two sides of any  triangle is greater than the third side. We  introduce this idea to labeling of graphs. A (p\,q)-graph G=(V\,E) is said to be in Euclid(0) if there exists a bijection f: V(G) –> {1\,…\,p} such that for each induced C3 subgraph with vertices {v1\,v2\,v3} with f(v1)f(v3) . \nFor k > 1\, G is in Euclid(k) class of graphs if there exits smallest k such that G U Nk in Euclid(0)\, where Nk is the null graph with k isolated points. We exhibit infinitely many graphs in Euclid(k) for each k. The talk is target to general audiences. Several open problems will posed for future research. The report is the joint work with several high school\, undergraduate students and researchers. URL:https://colleges.claremont.edu/ccms/event/antc-talk-sin-min-lee-sjsu/ 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:20190924T121500 DTEND;TZID=America/Los_Angeles:20190924T131000 DTSTAMP:20260419T120023 CREATED:20190813T023810Z LAST-MODIFIED:20190917T034004Z UID:1360-1569327300-1569330600@colleges.claremont.edu SUMMARY:Adinkras: Snapshots of Supersymmetry (Jordan Kostiuk\, Brown University) DESCRIPTION:An “Adinkra” is a graphical tool to describe a branch of particle physics known as supersymmetry. Understanding the mathematics of Adinkras shines a light on the underlying physics\, as well as helps to explore new areas of mathematics. After describing the basic structure of Adinkras\, I will discuss some of these interesting interactions between mathematics and physics.This talk is intended for a general mathematics audience; undergraduate students are welcome. URL:https://colleges.claremont.edu/ccms/event/antc-seminar-jordan-kostiuk-brown-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 END:VCALENDAR