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:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211102T123000
DTEND;TZID=America/Los_Angeles:20211102T132000
DTSTAMP:20260408T074510
CREATED:20210826T052223Z
LAST-MODIFIED:20211025T185715Z
UID:2221-1635856200-1635859200@colleges.claremont.edu
SUMMARY:Counting points in discrete subgroups (Jeff Vaaler\, UT Austin)
DESCRIPTION:We consider the problem of comparing the number of discrete points that belong to a set with the measure (or volume) of the set\, under circumstances where we expect these two numbers to be approximately equal. We start with a locally compact\, abelian\, topological group G. We assume that G has a countably infinite\, torsion free\, discrete subgroup H. But to make the talk easier to follow we will mostly consider the case G = R^N and H = Z^N. If E ⊆ R^N is a subset there are many situations where one expects that the (finite\, positive) number Vol_N (E) is approximately equal to the cardinality |E ∩ Z^N |. We will sketch the proof of a general result that bounds the difference between these quantities. If k is an algebraic number field and k_A is the ring of adeles associated to k\, this general result is useful when G = k_A^N and H = k^N .
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-jeff-vaaler-ut-austin/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211109T123000
DTEND;TZID=America/Los_Angeles:20211109T132000
DTSTAMP:20260408T074510
CREATED:20210825T201712Z
LAST-MODIFIED:20211101T172659Z
UID:2218-1636461000-1636464000@colleges.claremont.edu
SUMMARY:The Chow ring of heavy/light Hassett spaces via tropical geometry (Dagan Karp\, HMC)
DESCRIPTION:Hassett spaces in genus 0 are moduli spaces of weighted pointed stable rational curves; they are important in the minimal model program and enumerative geometry. We compute the Chow ring of heavy/light Hassett spaces. The computation involves intersection theory on the toric variety corresponding to a graphic matroid\, and rests upon the work of Cavalieri-Hampe-Markwig-Ranganathan. This is joint work with Siddarth Kannan and Shiyue Li.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-dagan-karp-hmc/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211116T123000
DTEND;TZID=America/Los_Angeles:20211116T132000
DTSTAMP:20260408T074510
CREATED:20210821T181311Z
LAST-MODIFIED:20211101T170121Z
UID:2206-1637065800-1637068800@colleges.claremont.edu
SUMMARY:On sparse representation of vectors in lattices and semigroups (Iskander Aliev\, Cardiff University)
DESCRIPTION:We will discuss the sparsity of the solutions to systems of linear Diophantine equations with and without non-negativity constraints. The sparsity of a solution vector is the number of its nonzero entries\, which is referred to as the 0-norm of the vector. Our main results are new improved bounds on the minimal 0-norm of solutions to systems Ax=b\, where A is an integer matrix\, b is an integer vector and x is either a general integer vector (lattice case) or a non-negative integer vector (semigroup case). The talk is based on a joint work with G. Averkov\, J. A. De Loera and T. Oertel.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-iskander-aliev-cardiff-university/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211130T123000
DTEND;TZID=America/Los_Angeles:20211130T132000
DTSTAMP:20260408T074510
CREATED:20210819T183424Z
LAST-MODIFIED:20211118T191414Z
UID:2203-1638275400-1638278400@colleges.claremont.edu
SUMMARY:Odd subgraphs are odd (Asaf Ferber\, UC Irvine)
DESCRIPTION:In this talk we discuss some problems related to finding large induced subgraphs of a given graph G which satisfy some degree-constraints (for example\, all degrees are odd\, or all degrees are j mod k\, etc). We survey some classical results\, present some interesting and challenging problems\, and sketch solutions to some of them. This is based on joint works with Michael Krivelevich\, and with Liam Hardiman and Michael Krivelevich.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-asaf-ferber-uc-irvine/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR