Differences

This shows you the differences between two versions of the page.

--- sessions:2021sessions:2021session3 [2021/05/03 11:46] – ross.kang
+++ sessions:2021sessions:2021session3 [2021/05/13 12:23] – ross.kang
@@ Line 21: / Line 21: @@
-==== Confirmed participants ====
+==== Confirmed participants (updated 12 May) ====
@@ Line 43: / Line 43: @@
   * Jeroen Huijben
   * Mehmet Akif Yildiz
+  * Tobias Müller
+  * Vilhelm Agdur
+  * Allan Lo
+  * Ashwin Sah
+  * Mehtaab Sawhney
+  * Cynthia Stoner
+  * Dingding Dong
+  * Nitya Mani
+  * Krystal Guo
+  * Jiaheng Wang
+  * Giorgos Mousa
 *denotes speaker
@@ Line 59: / Line 70: @@
-==== Schedule (tentative) ====
+==== Schedule (all times European) ====
 . Monday, 17 May
-    a. Talk (15:00 Barvinok)
+    a. Welcome (14:55)
-    b. Open problem session/group formation (17:00-18:30)
+    b. Talk (15:00-15:45 Barvinok)
+    c. Open problem session/group formation (16:00-)
 . Tuesday, 18 May
-    a. Talk (15:00 Zhao)
+    a. Open working sessions
+    b. Talk (15:00-15:45 Zhao)
+    c. Coffee break in gather.town (after talk)
 . Wednesday, 19 May
-    a. Talk (15:00 Perkins)
+    a. Open working sessions
-    b. Progress reports (16:00)
+    b. Talk (15:00-15:45 Perkins)
+    c. Progress reports (16:00)
+    d. Social event in gather.town/zoom (organised by David de Boer)
 . Thursday, 20 May
-    a. Talk (15:00 Brown)
+    a. Open working sessions
+    b. Talk (15:00-15:45 Brown)
+    c. Coffee break in gather.town (after talk)
 . Friday, 21 May
-    a. Talk (15:00 Galanis)
+    a. Talk (15:00-15:45 Galanis)
-    b. Progress reports/Closing (16:00-17:30)
+    b. Progress reports/Remaining open problems (16:00-)
+    c. Closing
+The zoom room for talks: https://uva-live.zoom.us/j/87839343064?pwd=M25UNmhwcnd4NURXRkI0Q09MWWdEUT09
 ==== Talks ====
-Alexander Barvinok
+===Alexander Barvinok: Computing partition functions by interpolation===
-Yufei Zhao
+This is a brief overview of how to compute partition functions (combinatorially defined polynomials) by interpolation. As examples, we will consider permanents of complex matrices and matching polynomials of graphs.
-Will Perkins
-Jason Brown
+===Yufei Zhao: Extremal regular graphs: independent sets, colorings, and graph homomorphisms===
+I will survey some problems, results, and techniques concerning tight upper bounds on the number of independent sets, proper q-colorings, and, more generally, graph homomorphisms, specifically problems of the following form: fix d and a (weighted) graph H, which d-regular graph G maximizes hom(G, H)^{1/v(G)}?
+===Will Perkins: Polymer models in statistical physics, combinatorics, and algorithms===
+I will introduce abstract polymer models (as introduced by Kotecky and Preiss) and describe how they can be used to analyze low-temperature statistical physics models by changing perspective from a spin system at low temperature to a dilute polymer system. I will mention applications including proving zero-freeness results for polynomials, describing low temperature phase diagrams, and combinatorial and algorithmic enumeration.
+===Jason Brown: Independence Polynomials and Their Roots===
+Independence polynomials are generating functions for the number of independent sets of each cardinality in a graph G. In addition to encoding useful information about the graph (such as the number of vertices, the number of edges and the independence number), the analytic and algebraic properties can say much about the shape and inter-dependence of the coefficients. In this talk we focus on the nature and location of the roots of such polynomials, and even cross paths with a fractal or two! This research is joint with Ben Cameron, Iain Beaton, Karl Dilcher and Richard Nowakowski.
+===Andreas Galanis: Hardness of Partition Functions via Complex Dynamics===
+In this talk, we will review recent approaches to study the approximability of partition functions in the complex plane, using ideas from complex dynamics. We will focus mainly on the hard-core and Ising models, and discuss how these techniques have recently been applied to obtain strong inapproximability results for computing averages on the real line, such as the average size of independent sets or the mean magnetization in the Ising model.
-Andreas Galanis