BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211012T090000
DTEND;TZID=America/New_York:20211012T100000
DTSTAMP:20240304T100222Z
CREATED:20240213T114547Z
LAST-MODIFIED:20240304T100222Z
UID:10002513-1634029200-1634032800@cmsa.fas.harvard.edu
SUMMARY:10/12/2021 Combinatorics\, Physics and Probability Seminar
DESCRIPTION:Title: On counting algebraically defined graphs \nAbstract: For many classes of graphs that arise naturally in discrete geometry (for example intersection graphs of segments or disks in the plane)\, the edges of these graphs can be defined algebraically using the signs of a finite list of fixed polynomials. We investigate the number of n-vertex graphs in such an algebraically defined class of graphs. Warren’s theorem (a variant of a theorem of Milnor and Thom) implies upper bounds for the number of n-vertex graphs in such graph classes\, but all the previously known lower bounds were obtained from ad hoc constructions for very specific classes. We prove a general theorem giving a lower bound for this number (under some reasonable assumptions on the fixed list of polynomials)\, and this lower bound essentially matches the upper bound from Warren’s theorem.
URL:https://cmsa.fas.harvard.edu/event/10-12-2021-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
END:VEVENT
END:VCALENDAR