BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20211005T090000
DTEND;TZID=America/New_York:20211005T100000
DTSTAMP:20240304T085033Z
CREATED:20240213T113617Z
LAST-MODIFIED:20240304T085033Z
UID:10002508-1633424400-1633428000@cmsa.fas.harvard.edu
SUMMARY:10/5/2021 Combinatorics\, Physics and Probability Seminar
DESCRIPTION:Title: Geodesic Geometry on Graphs \nAbstract: In a graph G = (V\, E) we consider a system of paths S so that for every two vertices u\,v in V there is a unique uv path in S connecting them. The path system is said to be consistent if it is closed under taking subpaths\, i.e. if P is a path in S then any subpath of P is also in S. Every positive weight function w: E–>R^+ gives rise to a consistent path system in G by taking the paths in S to be geodesics w.r.t. w. In this case\, we say w induces S. We say a graph G is metrizable if every consistent path system in G is induced by some such w. \nWe’ll discuss the concept of graph metrizability\, and\, in particular\, we’ll see that while metrizability is a rare property\, there exists infinitely many 2-connected metrizable graphs. \nJoint work with Nati Linial.
URL:https://cmsa.fas.harvard.edu/event/10-5-2021-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
END:VEVENT
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
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211019T090000
DTEND;TZID=America/New_York:20211019T100000
DTSTAMP:20240304T100424Z
CREATED:20240213T114112Z
LAST-MODIFIED:20240304T100424Z
UID:10002511-1634634000-1634637600@cmsa.fas.harvard.edu
SUMMARY:10/19/2021 Combinatorics\, Physics and Probability Seminar
DESCRIPTION:Title: Ising model\, total positivity\, and criticality \nAbstract: The Ising model\, introduced in 1920\, is one of the most well-studied models in statistical mechanics. It is known to undergo a phase transition at critical temperature\, and has attracted considerable interest over the last two decades due to special properties of its scaling limit at criticality.\nThe totally nonnegative Grassmannian is a subset of the real Grassmannian introduced by Postnikov in 2006. It arises naturally in Lusztig’s theory of total positivity and canonical bases\, and is closely related to cluster algebras and scattering amplitudes.\nI will give some background on the above objects and then explain a precise relationship between the planar Ising model and the totally nonnegative Grassmannian\, obtained in our recent work with P. Pylyavskyy. Building on this connection\, I will give a new boundary correlation formula for the critical Ising model
URL:https://cmsa.fas.harvard.edu/event/10-19-2021-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211026T090000
DTEND;TZID=America/New_York:20211026T100000
DTSTAMP:20240304T101126Z
CREATED:20240213T113529Z
LAST-MODIFIED:20240304T101126Z
UID:10002507-1635238800-1635242400@cmsa.fas.harvard.edu
SUMMARY:The n-queens problem
DESCRIPTION:Abstract: The n-queens problem asks how many ways there are to place n queens on an n x n chessboard so that no two queens can attack one another\, and the toroidal n-queens problem asks the same question where the board is considered on the surface of a torus. Let Q(n) denote the number of n-queens configurations on the classical board and T(n) the number of toroidal n-queens configurations. The toroidal problem was first studied in 1918 by Pólya who showed that T(n)>0 if and only if n is not divisible by 2 or 3. Much more recently Luria showed that T(n) is at most ((1+o(1))ne^{-3})^n and conjectured equality when n is not divisible by 2 or 3. We prove this conjecture\, prior to which no non-trivial lower bounds were known to hold for all (sufficiently large) n not divisible by 2 or 3. We also show that Q(n) is at least ((1+o(1))ne^{-3})^n for all natural numbers n which was independently proved by Luria and Simkin and\, combined with our toroidal result\, completely settles a conjecture of Rivin\, Vardi and Zimmerman regarding both Q(n) and T(n). \nIn this talk we’ll discuss our methods used to prove these results. A crucial element of this is translating the problem to one of counting matchings in a 4-partite 4-uniform hypergraph. Our strategy combines a random greedy algorithm to count `almost’ configurations with a complex absorbing strategy that uses ideas from the methods of randomised algebraic construction and iterative absorption. \nThis is joint work with Peter Keevash.
URL:https://cmsa.fas.harvard.edu/event/10-26-2021-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
END:VEVENT
END:VCALENDAR