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:20191202T121500
DTEND;TZID=America/Los_Angeles:20191202T131000
DTSTAMP:20260413T115712
CREATED:20200116T235236Z
LAST-MODIFIED:20200116T235237Z
UID:1772-1575288900-1575292200@colleges.claremont.edu
SUMMARY:ANTC Seminar: Random Monomial Ideals (Lily Silverstein\, CalPoly Pomona)
DESCRIPTION:Probability is a now-classic tool in combinatorics\, especially graph theory. Some applications of probabilistic techniques are: (1) describing the typical/expected properties of a class of objects\, (2) uncovering phase transitions and sudden thresholds in the dependence of one property on another\, and (3) producing examples of conjectured or unusual objects. (This last technique is sometimes called “the probabilistic method.”)\nThis talk will apply these techniques to commutative algebra\, using monomial ideals as a bridge between combinatorics and algebra. I’ll introduce a family of random models for monomial ideals\, and describe results of each type mentioned above\, for instance: (1) typical projective dimension\, (2) thresholds in Krull dimension as a function of number of monomial generators\, and (3) how to generate unlimited examples of monomial ideals which aren’t generic (in the Bayer-Peeva-Sturmfels sense)\, but which nevertheless have minimal free resolutions that can be read from their Scarf complexes.\nJoint work with subsets of: Jesús A. De Loera\, Serkan Hoşten\, Robert Krone\, Sonja Petrović\, Despina Stasi\, Dane Wilburne\, and Jay Yang.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-random-monomial-ideals-lily-silverstein-calpoly-pomona/
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:20191203T121500
DTEND;TZID=America/Los_Angeles:20191203T131000
DTSTAMP:20260413T115712
CREATED:20190826T173520Z
LAST-MODIFIED:20191125T232345Z
UID:1376-1575375300-1575378600@colleges.claremont.edu
SUMMARY:ANTC Seminar: Random Monomial Ideals (Lily Silverstein\, CalPoly Pomona)
DESCRIPTION:Probability is a now-classic tool in combinatorics\, especially graph theory. Some applications of probabilistic techniques are: (1) describing the typical/expected properties of a class of objects\, (2) uncovering phase transitions and sudden thresholds in the dependence of one property on another\, and (3) producing examples of conjectured or unusual objects. (This last technique is sometimes called “the probabilistic method.”)\n\nThis talk will apply these techniques to commutative algebra\, using monomial ideals as a bridge between combinatorics and algebra. I’ll introduce a family of random models for monomial ideals\, and describe results of each type mentioned above\, for instance: (1) typical projective dimension\, (2) thresholds in Krull dimension as a function of number of monomial generators\, and (3) how to generate unlimited examples of monomial ideals which aren’t generic (in the Bayer-Peeva-Sturmfels sense)\, but which nevertheless have minimal free resolutions that can be read from their Scarf complexes.\n\nJoint work with subsets of: Jesús A. De Loera\, Serkan Hoşten\, Robert Krone\, Sonja Petrović\, Despina Stasi\, Dane Wilburne\, and Jay Yang.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-lily-silverstein-calpoly-pomona/
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:20191210T121500
DTEND;TZID=America/Los_Angeles:20191210T131000
DTSTAMP:20260413T115712
CREATED:20190910T235400Z
LAST-MODIFIED:20191206T231105Z
UID:1526-1575980100-1575983400@colleges.claremont.edu
SUMMARY:Computational bounds for doing harmonic analysis on permutation modules of finite groups (Mike Orrison\, HMC)
DESCRIPTION:In this talk\, I will describe an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of permutation modules\, and it uses the multiplicities of irreducible submodules within individual orbital spaces to express the resulting computational bounds. I will then conclude by showing that these bounds are surprisingly small when dealing with certain permutation modules arising from the action of the symmetric group on tabloids. This is joint work with Michael Hansen\, Masanori Koyama\, Matthew McDermott\, and Sarah Wolff.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-mike-orrison-hmc/
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