Warwick's combinatorics seminar in 2021-22 will be held in a hybrid format 2-3pm UK time on Wednesdays, occasionally 4-5pm UK time on Wednesdays (see the notes below), in the room B3.02 and on ZOOM.
Join Zoom Meeting
Meeting ID: 823 9801 5989
|6 Oct||Allan Sly (Princeton)||Factor of IID for the Ising model on the tree||online|
|20 Oct||Henry Towsner (Pennsylvania)||Regularity Lemmas as Structured Decompositions||online|
|27 Oct||Rob Silversmith (Warwick)||Cross-ratios and perfect matchings|
|10 Nov||Łukasz Grabowski (Lancaster)||TBA|
|17 Nov||Natasha Morrison (Victoria)||TBA||online, 4pm|
|1 Dec||Martin Winter (Warwick)||TBA|
|8 Dec||George Kontogeorgiou (Warwick)||TBA|
It's known that there are factors of IID for the free Ising model on the d-regular tree when it has a unique Gibbs measure and not when reconstruction holds (when it is not extremal). We construct a factor of IID for the free Ising model on the d-regular tree in (part of) its intermediate regime, where there is non-uniqueness but still extremality. The construction is via the limit of a system of stochastic differential equations.
One way of viewing Szemerédi's regularity lemma is that it gives a way of decomposing a graph (approximately) into a structured part (the "unary" data) and a random part. Then hypergraph regularity, the generalization to k-uniform hypergraphs, can be viewed as a decomposition into multiple "tiers" of structure - a unary part as well as a binary part and so on, and then finally a random part.
We'll discuss how an analytic approach can make these decompositions exact instances of the conditional expectation in probability, and how these analytic proofs relate to combinatorial proofs with explicit bounds. Finally, we'll discuss regularity lemmas for other mathematical objects, focusing on the example of ordered graphs and hypergraphs, and show how the "tiers of structures" perspective makes it possible to see regularity lemmas for other mathematical objects as examples of the regularity lemma for hypergraphs.
(No prior knowledge of the regularity lemma and its variants is assumed.)
I’ll describe a simple process from algebraic geometry that takes in a collection of 4-element subsets S1,S2,…,Sn-3 of [n], and outputs a nonnegative integer called a cross-ratio degree. I’ll discuss several interpretations of cross-ratio degrees in algebra, algebraic geometry, and tropical geometry, and present a combinatorial algorithm for computing them, due to C. Goldner. I’ll then present a perhaps-surprising upper bound for cross-ratio degrees in terms of matchings.