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: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:20221004T121500
DTEND;TZID=America/Los_Angeles:20221004T131000
DTSTAMP:20260408T100239
CREATED:20220829T210323Z
LAST-MODIFIED:20221003T234340Z
UID:2800-1664885700-1664889000@colleges.claremont.edu
SUMMARY:Recent developments on the slice rank polynomial method with applications (Mohamed Omar\, HMC)
DESCRIPTION:The slice rank polynomial method\, motivated by groundbreaking work of Croot\, Lev and Pach and refined by Tao\, has opened the door to the resolution of many problems in extremal combinatorics. We survey these results and discuss contributions in several of the speaker’s recent papers.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-mohamed-omar-hmc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221011T121500
DTEND;TZID=America/Los_Angeles:20221011T131000
DTSTAMP:20260408T100239
CREATED:20220825T192011Z
LAST-MODIFIED:20221004T211454Z
UID:2794-1665490500-1665493800@colleges.claremont.edu
SUMMARY:On the geometry of lattice extensions (Max Forst\, CGU)
DESCRIPTION:Given a lattice L\, an extension of L is a lattice M of strictly greater rank so that L is equal to the intersection of the subspace spanned by L with M. In this talk\, we will discus constructions of such lattice extensions with particular geometric invariants of M\, such as the determinant\, covering radius and successive minima related to the analogous invariants of L. Joint work with Lenny Fukshansky.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-max-forst-cgu/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221025T121500
DTEND;TZID=America/Los_Angeles:20221025T131000
DTSTAMP:20260408T100239
CREATED:20220906T160323Z
LAST-MODIFIED:20221012T181637Z
UID:2834-1666700100-1666703400@colleges.claremont.edu
SUMMARY:Properties of redistricting Markov chains (Sarah Cannon\, CMC)
DESCRIPTION:Markov chains have become widely-used to generate random political districting plans. These random districting plans can be used to form a baseline for comparison\, and any proposed districting plans that differ significantly from this baseline can be flagged as potentially gerrymandered. However\, very little is rigorously known about these Markov chains – Are they irreducible? What is their mixing time? For some\, even the stationary distribution remains unknown. I will present recent work that answers some of these questions\, which uses tools from probability\, computational geometry\, and more.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sarah-cannon-cmc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR