Warwick Combinatorics

Home > What's on > Warwick Combinatorics

Warwick Combinatorics

 Apr 30 2021

14:00 - 15:00

The seminars occur weekly on a Friday, times vary depending on the location of the speaker.

View the Warwick Cominatorics Home Page

This seminar series is not recorded.

Future Seminars

30 Apr
Agnes Backhausz (Budapest) - Typicality and entropy of processes on infinite trees
When we study random d-regular graphs from the point of view of graph limit theory, the notion of typical processes arise naturally. These are certain invariant families of random variables indexed by the infinite regular tree. Since this tree is the local limit of random d-regular graphs when d is fixed and the number of vertices tends to infinity, we can consider the processes that can be approximated with colorings (labelings) of random d-regular graphs. These are the so-called typical processes, whose properties contain useful information about the structure of finite random regular graphs. In earlier works, various necessary conditions have been given for a process to be typical, by using correlation decay or entropy inequalities. In the work presented in the talk, we go in the other direction and provide sufficient entropy conditions in the special case of edge Markov processes. This condition can be extended to unimodular Galton--Watson random trees as well. Joint work with Charles Bordenave and Balázs Szegedy (https://arxiv.org/abs/2102.02653).

7 May
Gwen McKinley (San Diego) - Counting integer partitions with the method of maximum entropy (5:30pm UK time)
We give an asymptotic formula for the number of partitions of an integer n where the sums of the kth powers of the parts are also fixed, for some collection of values k. To obtain this result, we reframe the counting problem as an optimization problem, and find the probability distribution on the set of all integer partitions with maximum entropy among those that satisfy our restrictions in expectation (in essence, this is an application of Jaynes' principle of maximum entropy). This approach leads to an approximate version of our formula as the solution to a relatively straightforward optimization problem over real-valued functions. To establish more precise asymptotics, we prove a local central limit theorem using an equidistribution result of Green and Tao.

A large portion of the talk will be devoted to outlining how our method can be used to re-derive a classical result of Hardy and Ramanujan, with an emphasis on the intuitions behind the method, and limited technical detail. This is joint work with Marcus Michelen and Will Perkins.

14 May
Pascal Schweitzer (Darmstadt) TBA

21 May
Gabor Elek (Lancaster) TBA

28 May
Pierre-Loïc Méliot (Orsay) TBA

4 Jun
Gabor Kun (Budapest) TBA

11 Jun
Information coming soon.

18 Jun
Vishesh Jain (Stanford) TBA

25 Jun
Information coming soon.

2 Jul
Information coming soon.


Past Seminars

19 April 2020

Robert Simon, LSE


6 May 2020

Thomas Johnston, Oxford


13 May 2020

Sergey Norin, McGill University


20 May 2020

Olof Sisask, Stockholm


27 May 2020

Peleg Michaeli, Tel Aviv


3 June 2020

Yifan Jing, UIUC


10 June 2020

Yahav Alon, Tel Aviv


17 June 2020

Andrzej Grzesik, Jagiellonian


24 June 2020

Bjarne Schülke, Hamburg


9 October 2020

László Lovász, Budapest


16 October 2020

Marthe Bonamy, Bordeaux


23 October 2020

Gábor Tardos, Budapest


30 October 2020

Maria Chudnovsky, Princeton


6 November 2020

Boris Bukh, Pittsburgh


13 November 2020

Tibor Szabó, Berlin


20 November 2020

Benny Sudakov, ETH Zurich


27 November 2020

Anton Bernshteyn, Georgia Tech


4 December 2020

Bhargav Narayanan, Rutgers - Homeomorphs


11 December 2020

Hong Liu, Warwick - Extreme density for sparse minors and subdivisions


15 January 2021

Pál Galicza, Budapest - Sparse reconstruction for iid variables


22 January 2021

Alexander Razborov, Chicago - Theons and Quasirandomness


29 January 2021

Lisa Sauermann, IAS - On Polynomials that vanish to high order on most of the hypercube

12 February 2021

Gábor Pete, Budapest - The Free Uniform Spanning Forest is disconnected in some virtually free groups, depending on the generating set

19 Feb 2021

Jan Kurkofka, Hamburg - Every infinitely edge-connected graph contains the Farey graph or T_{ℵ0}*t as a minor


26 Feb 2021

Lutz Warnke, Georgia Tech - Prague dimension of random graphs


5 March, 13.30 GMT

Louis Esperet, Grenoble - Asymptotic dimension of graphs


 12 March, 14.00 GMT

Annie Raymond, Massachusetts Amherst - Graph Density Inequalities, Sums of Squares and Tropicalization


19 March, 17.30 GMT

Daniel Spielman, Yale - Finite Free Probability and Ramanujan Graphs

This seminar series is supported as part of the ICMS Online Mathematical Sciences Seminars.