BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Yifan Jing (UIUC)
DTSTART;VALUE=DATE-TIME:20200603T130000Z
DTEND;VALUE=DATE-TIME:20200603T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/1
DESCRIPTION:Title: Stru
ctures of sets with minimal measure growth\nby Yifan Jing (UIUC) as pa
rt of Warwick Combinatorics Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/WCS/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yahav Alon (Tel Aviv)
DTSTART;VALUE=DATE-TIME:20200610T130000Z
DTEND;VALUE=DATE-TIME:20200610T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/2
DESCRIPTION:Title: Hitt
ing time of disjoint Hamilton cycles in random subgraph processes\nby
Yahav Alon (Tel Aviv) as part of Warwick Combinatorics Seminar\n\nAbstract
: TBA\n
LOCATION:https://researchseminars.org/talk/WCS/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andrzej Grzesik (Jagiellonian)
DTSTART;VALUE=DATE-TIME:20200617T130000Z
DTEND;VALUE=DATE-TIME:20200617T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/3
DESCRIPTION:Title: The
Turán number of blow-ups of trees\nby Andrzej Grzesik (Jagiellonian)
as part of Warwick Combinatorics Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/WCS/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bjarne Schülke (Hamburg)
DTSTART;VALUE=DATE-TIME:20200624T130000Z
DTEND;VALUE=DATE-TIME:20200624T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/4
DESCRIPTION:Title: Extr
emal problems concerning the traces of sets\nby Bjarne Schülke (Hambu
rg) as part of Warwick Combinatorics Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/WCS/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:László Lovász (Budapest)
DTSTART;VALUE=DATE-TIME:20201009T130000Z
DTEND;VALUE=DATE-TIME:20201009T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/5
DESCRIPTION:Title: Grap
h limits\, measures\, and flows\nby László Lovász (Budapest) as par
t of Warwick Combinatorics Seminar\n\n\nAbstract\nThe theory of graph limi
ts is only understood to a somewhat\nsatisfactory degree in the cases of d
ense graphs and of bounded degree\ngraphs. There is\, however\, a lot of i
nterest in the intermediate cases.\nIt appears that the most important con
stituents of graph limits in the\ngeneral case will be Markov spaces (Mark
ov chains on measurable spaces\nwith a stationary distribution).\n\nThis m
otivates our goal to extend some important theorems from finite\ngraphs to
Markov spaces or\, more generally\, to measurable spaces. In\nthis talk w
e show that much of flow theory\, one of the most important\nareas in grap
h theory\, can be extended to measurable spaces. In\nparticular\, the Hoff
man Circulation Theorem\, the Max-Flow-Min-Cut\nTheorem\, Multicommodity F
low Theorem\, and several other results have\nsimple and elegant extension
s to measures.\n
LOCATION:https://researchseminars.org/talk/WCS/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marthe Bonamy (Bordeaux)
DTSTART;VALUE=DATE-TIME:20201016T130000Z
DTEND;VALUE=DATE-TIME:20201016T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/6
DESCRIPTION:Title: Grap
h recolouring\nby Marthe Bonamy (Bordeaux) as part of Warwick Combinat
orics Seminar\n\n\nAbstract\nGiven a solution to a problem\, we can try an
d apply a series of elementary operations to it\, making sure to remain in
the solution space at every step. What kind of solutions can we reach thi
s way? How fast? This is motivated by a variety of applications\, from sta
tistical physics to real-life scenarios\, including enumeration and sampli
ng. In this talk\, we will discuss various positive and negative results\,
in the special case of graph colouring.\n
LOCATION:https://researchseminars.org/talk/WCS/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gábor Tardos (Budapest)
DTSTART;VALUE=DATE-TIME:20201023T130000Z
DTEND;VALUE=DATE-TIME:20201023T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/7
DESCRIPTION:Title: Conv
ergence and limits of finite trees\nby Gábor Tardos (Budapest) as par
t of Warwick Combinatorics Seminar\n\n\nAbstract\nSeeing the success of li
mit theory of dense finite graphs with graphons as their limit objects we
developed a similar (?) theory for finite trees. In order for the sampling
limit to make sense we need to make the trees "dense" - we do this by con
sidering them as metric spaces with the normalized graph distance. Using u
ltaproducts is a simple and elegant way to find unique limit objects (we c
all them dendrons) and also to highlight similarities and major difference
s from the theory of dense graph limits. For the underlying quantitative a
pproximation results\, one needs more "down to earth" techniques to be dev
eloped.\nThis is joint work with Gábor Elek.\n
LOCATION:https://researchseminars.org/talk/WCS/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maria Chudnovsky (Princeton)
DTSTART;VALUE=DATE-TIME:20201030T140000Z
DTEND;VALUE=DATE-TIME:20201030T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/8
DESCRIPTION:Title: Even
-hole free graphs of bounded degree have bounded treewidth\nby Maria C
hudnovsky (Princeton) as part of Warwick Combinatorics Seminar\n\n\nAbstra
ct\nTree decompositions are a powerful tool in structural graph theory tha
t is traditionally used in the context of forbidden graph minors. Connect
ing tree decompositions and forbidden induced subgraphs has so far largely
remained out of reach. Traditionally to bound the treewidth of a graph\,
one finds a way to decompose it by a so-called laminar collection of\ndeco
mpositions. Recently\, in joint work with Tara Abrishami and Kristina \nV
uskovic\, we proved that even-hole free graphs of bounded degree have bou
nded tree-width. To do so we used "star cutset separations" that arise nat
urally in the context of even-hole-free graphs. While the set of star cuts
et separations is far from being non-crossing\, it turns out that one can
partition it into a bounded number of laminar collections\, and this is su
fficient for our purposes.\nIn this talk we will present an outline of the
proof.\n
LOCATION:https://researchseminars.org/talk/WCS/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Boris Bukh (Pittsburgh)
DTSTART;VALUE=DATE-TIME:20201106T140000Z
DTEND;VALUE=DATE-TIME:20201106T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/9
DESCRIPTION:Title: Empt
y axis-parallel boxes\nby Boris Bukh (Pittsburgh) as part of Warwick C
ombinatorics Seminar\n\n\nAbstract\nHow to place n points inside the d-dim
ensional unit cube so every large axis-parallel box contains at least one
point? We discuss the motivation as well as a partial solution to this pro
blem. This is a joint work with Ting-Wei Chao.\n
LOCATION:https://researchseminars.org/talk/WCS/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tibor Szabó (Berlin)
DTSTART;VALUE=DATE-TIME:20201113T140000Z
DTEND;VALUE=DATE-TIME:20201113T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/10
DESCRIPTION:Title: Mad
er-perfect digraphs\nby Tibor Szabó (Berlin) as part of Warwick Combi
natorics Seminar\n\n\nAbstract\nWe investigate the relationship of dichrom
atic number and subdivision containment in digraphs. We call a digraph Mad
er-perfect if for every (induced) subdigraph $F$\, any digraph of dichroma
tic number at least $v(F)$ contains an $F$-subdivision. We show that\, amo
ng others\, arbitrary orientated cycles\, bioriented trees\, and tournamen
ts on four vertices are Mader-perfect. The first result settles a conjectu
re of Aboulker\, Cohen\, Havet\, Lochet\, Moura\, and Thomasse\, while the
last one extends Dirac's Theorem about $4$-chromatic graphs containing a
$K_4$-subdivision to directed graphs. The talk represents joint work with
Lior Gishboliner and Raphael Steiner.\n
LOCATION:https://researchseminars.org/talk/WCS/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Benny Sudakov (Zurich)
DTSTART;VALUE=DATE-TIME:20201120T140000Z
DTEND;VALUE=DATE-TIME:20201120T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/11
DESCRIPTION:Title: Lar
ge independent sets from local considerations\nby Benny Sudakov (Zuric
h) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nHow well can gl
obal properties of a graph be inferred from observations that are purely l
ocal? This general question gives rise to numerous interesting problems. O
ne such very natural question was raised independently by Erdos-Hajnal and
Linial-Rabinovich in the early 90's. How large must the independence numb
er $\\alpha (G)$ of a graph $G$ be whose every $m$ vertices contain an ind
ependent set of size $r$? In this talk we discuss new methods to attack th
is problem which improve many previous results.\n
LOCATION:https://researchseminars.org/talk/WCS/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Anton Bernshteyn (Georgia Tech)
DTSTART;VALUE=DATE-TIME:20201127T140000Z
DTEND;VALUE=DATE-TIME:20201127T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/12
DESCRIPTION:Title: Mea
surable colorings\, the Lovász Local Lemma\, and distributed algorithms\nby Anton Bernshteyn (Georgia Tech) as part of Warwick Combinatorics Se
minar\n\n\nAbstract\nIn the past twenty or so years\, a rich theory has em
erged concerning the behavior of graph colorings\, matchings\, and other c
ombinatorial notions under additional regularity requirements\, for instan
ce measurability. It turns out that this area is closely related to distri
buted computing\, i.e.\, the part of computer science concerned with probl
ems that can be solved efficiently by a decentralized network of processor
s. A key role in this relationship is played by the Lovász Local Lemma an
d its analogs in the measurable setting. In this talk I will outline this
relationship and present a number of applications.\n
LOCATION:https://researchseminars.org/talk/WCS/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bhargav Narayanan (Rutgers)
DTSTART;VALUE=DATE-TIME:20201204T140000Z
DTEND;VALUE=DATE-TIME:20201204T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/13
DESCRIPTION:Title: Hom
eomorphs\nby Bhargav Narayanan (Rutgers) as part of Warwick Combinator
ics Seminar\n\n\nAbstract\nNati Linial asked the following basic problem i
n 2006: Given a $k$-dimensional simplicial complex $S$\, how many facets c
an a $k$-complex on $n$ vertices have if it contains no topological copy o
f $S$? This is a beautiful and natural question\, but results in low dimen
sions apart ($k\\le 2$)\, very little was previously known. In this talk\,
I’ll provide an answer in all dimensions and take the scenic route to t
he answer\, surveying many natural problems about simplicial complexes alo
ng the way.\n
LOCATION:https://researchseminars.org/talk/WCS/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hong Liu (Warwick)
DTSTART;VALUE=DATE-TIME:20201211T140000Z
DTEND;VALUE=DATE-TIME:20201211T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/14
DESCRIPTION:Title: Ext
remal density for sparse minors and subdivisions\nby Hong Liu (Warwick
) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nHow dense a grap
h has to be to necessarily contain (topological) minors of a given graph $
H$? When $H$ is a complete graph\, this question is well understood by res
ult of Kostochka/Thomason for clique minor\, and result of Bollobas-Thomas
on/Komlos-Szemeredi for topological minor. The situation is a lot less cle
ar when $H$ is a sparse graph. We will present a general result on optimal
density condition forcing (topological) minors of a wide range of sparse
graphs. As corollaries\, we resolve several questions of Reed and Wood on
embedding sparse minors. Among others\,\n\n - $(1+o(1))t^2$ average d
egree is sufficient to force the $t\\times t$ grid as a topological minor\
;\n\n - $(3/2+o(1))t$ average degree forces $every$ $t$-vertex planar
graph as a minor\, and the constant $3/2$ is optimal\, furthermore\, surp
risingly\, the value is the same for $t$-vertex graphs embeddable on any f
ixed surface\;\n\n - a universal bound of $(2+o(1))t$ on average degr
ee forcing $every$ $t$-vertex graph in $any$ nontrivial minor-closed famil
y as a minor\, and the constant 2 is best possible by considering graphs w
ith given treewidth.\n\nJoint work with John Haslegrave and Jaehoon Kim.\n
LOCATION:https://researchseminars.org/talk/WCS/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pál Galicza (Budapest)
DTSTART;VALUE=DATE-TIME:20210115T140000Z
DTEND;VALUE=DATE-TIME:20210115T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/15
DESCRIPTION:Title: Spa
rse reconstruction for iid variables\nby Pál Galicza (Budapest) as pa
rt of Warwick Combinatorics Seminar\n\n\nAbstract\nFor a sequence of Boole
an functions $f_n : \\{-1\,1\\}^{V_n} \\longrightarrow \\{-1\,1\\}$\, defi
ned on increasing configuration spaces of random inputs\, we say that ther
e is sparse reconstruction if there is a sequence of subsets $U_n \\subset
eq V_n$ of the coordinates satisfying $|U_n| = o(|V_n|)$ such that knowin
g the coordinates in $U_n$ gives us a non-vanishing amount of information
about the value of $f_n$.\n\nWe first show that\, if the underlying measur
e is a product measure\, then no sparse reconstruction is possible for any
sequence of transitive functions. We discuss the question in different fr
ameworks\, measuring information content in $L^2$ and with entropy. We als
o highlight some interesting connections with cooperative game theory.\n\n
Using our results for transitive sequences of functions\, we answer a que
stion posed by Itai Benjamini and show that the left-right crossing event
for critical planar percolation on the square lattice does not admit spars
e reconstruction either. Joint work with Gábor Pete.\n
LOCATION:https://researchseminars.org/talk/WCS/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alexander Razborov (Chicago)
DTSTART;VALUE=DATE-TIME:20210122T173000Z
DTEND;VALUE=DATE-TIME:20210122T183000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/16
DESCRIPTION:Title: The
ons and quasirandomness\nby Alexander Razborov (Chicago) as part of Wa
rwick Combinatorics Seminar\n\n\nAbstract\nThere are two known approaches
to the theory of limits of discrete combinatorial objects: geometric (grap
h limits) and algebraic (flag algebras). In the first part of the talk we
present a general framework intending to combine useful features of both t
heories and compare it with previous attempts of this kind. Our main objec
ts are $T$-ons\, for a\nuniversal relational first-order theory $T$\; they
generalize many previously considered partial cases\, some of them (like
permutons) in a non-trivial way.\n\nIn the second part we apply this frame
work to offer a new perspective on quasi-randomness for combinatorial obje
cts more complicated than ordinary graphs. Our quasi-randomness properties
are natural in the sense that they do not use ad hoc densities and they a
re preserved under the operation of defining combinatorial structures of o
ne kind from structures of a different kind. One key concept in this theor
y is that of unique coupleability roughly meaning that any alignment of tw
o objects on the same ground set should ``look like'' random.\n\nBased on
joint work with Leonardo Coregliano.\n\nNote the unusual time!\n
LOCATION:https://researchseminars.org/talk/WCS/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lisa Sauermann (IAS)
DTSTART;VALUE=DATE-TIME:20210129T140000Z
DTEND;VALUE=DATE-TIME:20210129T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/17
DESCRIPTION:Title: On
polynomials that vanish to high order on most of the hypercube\nby Lis
a Sauermann (IAS) as part of Warwick Combinatorics Seminar\n\n\nAbstract\n
Motivated by higher vanishing multiplicity generalizations of Alon's Combi
natorial Nullstellensatz and its applications\, we study the following pro
blem: for fixed k and n large with respect to $k$\, what is the minimum po
ssible degree of a polynomial $P$ in $R[x_1\,...\,x_n]$ such that $P(0\,
…\,0)$ is non-zero and such that P has zeroes of multiplicity at least $
k$ at all points in $\\{0\,1\\}^n$ except the origin? For $k=1$\, a classi
cal theorem of Alon and Füredi states that the minimum possible degree of
such a polynomial equals $n$. We solve the problem for all $k>1$\, provin
g that the answer is $n+2k−3$. Joint work with Yuval Wigderson.\n
LOCATION:https://researchseminars.org/talk/WCS/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gábor Pete (Budapest)
DTSTART;VALUE=DATE-TIME:20210212T140000Z
DTEND;VALUE=DATE-TIME:20210212T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/18
DESCRIPTION:Title: The
Free Uniform Spanning Forest is disconnected in some virtually free group
s\, depending on the generating set\nby Gábor Pete (Budapest) as part
of Warwick Combinatorics Seminar\n\n\nAbstract\nThe uniform random spanni
ng tree of a finite graph is a classical object in probability and combina
torics. In an infinite graph\, one can take any exhaustion by finite subgr
aphs\, with some boundary conditions\, and take the limit measure. The Fre
e Uniform Spanning Forest (FUSF) is one of the natural limits\, but it is
less understood than the wired version\, the WUSF. Taking a finitely gener
ated group\, several properties of WUSF and FUSF have been known to be ind
ependent of the chosen Cayley graph of the group: the average degree in WU
SF and in FUSF\; the number of ends in the components of the WUSF and of t
he FUSF\; the number of trees in the WUSF. Lyons and Peres asked if this l
atter should also be the case for the FUSF.\n\nIn joint work with Ádám T
imár\, we give two different Cayley graphs of the same group such that th
e FUSF is connected in one of them but has infinitely many trees in the ot
her. Since our example is a virtually free group\, this is also a countere
xample to the general expectation that such "tree-like" graphs would have
connected FUSF. Many open questions are inspired by the results.\n
LOCATION:https://researchseminars.org/talk/WCS/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jan Kurkofka (Hamburg)
DTSTART;VALUE=DATE-TIME:20210219T140000Z
DTEND;VALUE=DATE-TIME:20210219T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/19
DESCRIPTION:Title: Eve
ry infinitely edge-connected graph contains the Farey graph or $T_{\\aleph
_0}*t$ as a minor\nby Jan Kurkofka (Hamburg) as part of Warwick Combin
atorics Seminar\n\n\nAbstract\nThe Farey graph plays a role in a number of
mathematical fields ranging from group theory and number theory to geomet
ry and dynamics. Curiously\, graph theory is not among these. We show that
the Farey graph plays a central role in graph theory too: it is one of tw
o infinitely edge-connected graphs that must occur as a minor in every inf
initely edge-connected graph. Previously it was not known that there was a
ny set of graphs determining infinite edge-connectivity by forming a minor
-minimal list in this way\, let alone a finite set.\n
LOCATION:https://researchseminars.org/talk/WCS/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lutz Warnke (Georgia Tech)
DTSTART;VALUE=DATE-TIME:20210226T140000Z
DTEND;VALUE=DATE-TIME:20210226T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/20
DESCRIPTION:Title: Pra
gue dimension of random graphs\nby Lutz Warnke (Georgia Tech) as part
of Warwick Combinatorics Seminar\n\n\nAbstract\nThe Prague dimension of gr
aphs was introduced by Nesetril\, Pultr and Rodl in the 1970s: as a combin
atorial measure of complexity\, it is closely related to clique edges cove
rings and partitions. Proving a conjecture of Furedi and Kantor\, we show
that the Prague dimension of the binomial random graph is typically of ord
er n/(log n) for constant edge-probabilities. \nThe main new proof ingredi
ent is a Pippenger-Spencer type edge-coloring result for random hypergraph
s with large uniformities\, i.e.\, edges of size O(log n). \n\nBased on jo
int work with He Guo and Kalen Patton\, see https://arxiv.org/abs/2011.094
59\n
LOCATION:https://researchseminars.org/talk/WCS/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Louis Esperet (Grenoble)
DTSTART;VALUE=DATE-TIME:20210305T133000Z
DTEND;VALUE=DATE-TIME:20210305T143000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/21
DESCRIPTION:Title: Asy
mptotic dimension of graphs\nby Louis Esperet (Grenoble) as part of Wa
rwick Combinatorics Seminar\n\n\nAbstract\nThe asymptotic dimension of a m
etric space is a notion introduced by Gromov in the 90s\, in connection wi
th geometric group theory. In the special case of the shortest path metric
associated to a graph\, a related notion\, called "weak network decomposi
tion" has been independently considered by theoretical computer scientists
\, with a different motivation. I will also explain some links with the cl
assical notion of graph coloring\, and some variants that have been studie
d since the end of the 90s.\n\nA class of graphs is minor-closed if any gr
aph obtained from a graph in the class by deleting vertices or edges\, or
contracting edges\, is still in the class. A typical example is the class
of all graphs embeddable on a fixed surface. We prove that every proper mi
nor-closed family of graphs has asymptotic dimension at most 2\, which giv
es optimal answers to a question of Fujiwara and Papasoglu and to a proble
m raised by Ostrovskii and Rosenthal on minor excluded groups.\n\nJoint wo
rk with M. Bonamy\, N. Bousquet\, C. Groenland\, C.-H. Liu\, F. Pirot\, an
d A. Scott.\n
LOCATION:https://researchseminars.org/talk/WCS/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Annie Raymond (Massachusetts Amherst)
DTSTART;VALUE=DATE-TIME:20210312T140000Z
DTEND;VALUE=DATE-TIME:20210312T150000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/22
DESCRIPTION:Title: Gra
ph Density Inequalities\, Sums of Squares and Tropicalization\nby Anni
e Raymond (Massachusetts Amherst) as part of Warwick Combinatorics Seminar
\n\n\nAbstract\nEstablishing inequalities among graph densities is a centr
al pursuit in extremal graph theory. One way to certify the nonnegativity
of a graph density expression is to write it as a sum of squares or as a r
ational sum of squares. In this talk\, we will explore how one does so and
we will then identify simple conditions under which a graph density expre
ssion cannot be a sum of squares or a rational sum of squares. Tropicaliza
tion will play a key role for the latter\, and will turn out to be an inte
resting object in itself. This is joint work with Greg Blekherman\, Mohit
Singh\, and Rekha Thomas.\n
LOCATION:https://researchseminars.org/talk/WCS/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Spielman (Yale)
DTSTART;VALUE=DATE-TIME:20210319T173000Z
DTEND;VALUE=DATE-TIME:20210319T183000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/23
DESCRIPTION:Title: Fin
ite Free Probability and Ramanujan Graphs\nby Daniel Spielman (Yale) a
s part of Warwick Combinatorics Seminar\n\n\nAbstract\nWe introduce a fini
te analog of Voiculescu's Free Probability that allows us to compute the e
xpected characteristic polynomials of certain random matrices and to prove
bounds on the locations of the roots of those polynomials. We sketch how
this theory may be used to prove that there exist bipartite Ramanujan grap
hs of every degree and number of vertices.\n\nNo prior knowledge of free p
robability or Ramanujan graphs will be assumed.\n\nThis is joint work with
Adam Marcus and Nikhil Srivastava.\n
LOCATION:https://researchseminars.org/talk/WCS/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Agnes Backhausz (Budapest)
DTSTART;VALUE=DATE-TIME:20210430T130000Z
DTEND;VALUE=DATE-TIME:20210430T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/24
DESCRIPTION:Title: Typ
icality and entropy of processes on infinite trees\nby Agnes Backhausz
(Budapest) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nWhen w
e study random $d$-regular graphs from the point of view of graph limit th
eory\, the notion of typical processes arise naturally. These are certain
invariant families of random variables indexed by the infinite regular tre
e. 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 rando
m $d$-regular graphs. These are the so-called typical processes\, whose pr
operties contain useful information about the structure of finite random r
egular graphs. In earlier works\, various necessary conditions have been g
iven for a process to be typical\, by using correlation decay or entropy i
nequalities. In the work presented in the talk\, we go in the other direct
ion and provide sufficient entropy conditions in the special case of edge
Markov processes. This condition can be extended to unimodular Galton--Wat
son random trees as well. Joint work with Charles Bordenave and Balázs Sz
egedy (https://arxiv.org/abs/2102.02653).\n
LOCATION:https://researchseminars.org/talk/WCS/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gwen McKinley (San Diego)
DTSTART;VALUE=DATE-TIME:20210507T163000Z
DTEND;VALUE=DATE-TIME:20210507T173000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/25
DESCRIPTION:Title: Cou
nting integer partitions with the method of maximum entropy\nby Gwen M
cKinley (San Diego) as part of Warwick Combinatorics Seminar\n\n\nAbstract
\nWe give an asymptotic formula for the number of partitions of an integer
$n$ where the sums of the $k$th powers of the parts are also fixed\, for
some collection of values $k$. To obtain this result\, we reframe the coun
ting problem as an optimization problem\, and find the probability distrib
ution on the set of all integer partitions with maximum entropy among thos
e that satisfy our restrictions in expectation (in essence\, this is an ap
plication of Jaynes' principle of maximum entropy). This approach leads to
an approximate version of our formula as the solution to a relatively str
aightforward optimization problem over real-valued functions. To establish
more precise asymptotics\, we prove a local central limit theorem using a
n equidistribution result of Green and Tao.\n\nA large portion of the talk
will be devoted to outlining how our method can be used to re-derive a cl
assical 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.\n
LOCATION:https://researchseminars.org/talk/WCS/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pascal Schweitzer (Darmstadt)
DTSTART;VALUE=DATE-TIME:20210514T130000Z
DTEND;VALUE=DATE-TIME:20210514T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/26
DESCRIPTION:Title: Aut
omorphisms of graphs with a forbidden minor\nby Pascal Schweitzer (Dar
mstadt) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nAccording
to Frucht’s classic theorem\, every finite group is the automorphism gro
up of a finite graph (up to isomorphism). We say the class of all graphs i
s universal. Babai proved in 1974 that graph classes with a forbidden mino
r\, such as planar graphs\, graphs of bounded genus\, and graphs of bounde
d tree width\, are not universal. He also made three conjectures regarding
automorphisms of such graphs. I will describe a structure theorem of auto
morphism groups of such graphs\, affirming these conjectures.\n\nThis is j
oint work with Martin Grohe and Daniel Wiebking.\n
LOCATION:https://researchseminars.org/talk/WCS/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gabor Elek (Lancaster)
DTSTART;VALUE=DATE-TIME:20210521T130000Z
DTEND;VALUE=DATE-TIME:20210521T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/27
DESCRIPTION:Title: Uni
form amenability\nby Gabor Elek (Lancaster) as part of Warwick Combina
torics Seminar\n\n\nAbstract\nAccording to the classical result of Connes\
, Feldman and Weiss\, measured hyperfiniteness of a group action is equiva
lent to measured amenability. In the Borel category it is known that hype
rfiniteness implies amenability and it is conjectured that the converse is
true. Based on the work of Anantharaman-Delaroche and Renault\, one can i
ntroduce the notion of uniform amenability\, a strengthening of measured a
menability (it is a sort of exactness in the category of measurable action
s\, so the famous Gromov-Osajda groups have no free uniformly amenable act
ions). One can also introduce the notion of uniform hyperfiniteness in a r
ather natural way. We prove that the two notions are equivalent provided t
hat the measurable action satisfies a boundedness condition for the Radon-
Nikodym derivative (e.g. in the case of Poisson boundaries).\n
LOCATION:https://researchseminars.org/talk/WCS/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Gabor Kun (Budapest)
DTSTART;VALUE=DATE-TIME:20210604T130000Z
DTEND;VALUE=DATE-TIME:20210604T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/28
DESCRIPTION:Title: Gra
phings without measurable perfect matchings\nby Gabor Kun (Budapest) a
s part of Warwick Combinatorics Seminar\n\n\nAbstract\nMeasurable matching
s of graphings (this is\, probability measure preserving Borel graphs) hav
e attracted a great deal of attention in the last decades. The Banach-Tars
ki paradox shows that the Hall condition does not guarantee the existence
of a measurable perfect matching in a bipartite graphing. Laczkovich gave
an example when the measurable Hall condition is not sufficient either. We
discuss the few such counterexamples.\n
LOCATION:https://researchseminars.org/talk/WCS/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pierre-Loïc Méliot (Orsay)
DTSTART;VALUE=DATE-TIME:20210528T130000Z
DTEND;VALUE=DATE-TIME:20210528T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/29
DESCRIPTION:Title: Dep
endency graphs\, upper bounds on cumulants and singular graphons\nby P
ierre-Loïc Méliot (Orsay) as part of Warwick Combinatorics Seminar\n\n\n
Abstract\nConsider a sum of random variables $S = \\sum_{v \\in V} A_v$. I
f the variables $A_v$ are weakly dependent\, then it is well known that un
der mild assumptions\, the distribution of $S$ is close to a normal distri
bution. The theory of dependency graphs enables one to make this statement
precise. In this framework\, we shall present new bounds on the cumulants
of $S$\, which enable one to have a combinatorial approach of this probab
ilistic results. One of the main application is the study of the fluctuati
ons of the densities of subgraphs in a random graph chosen according to a
graphon model. We shall see that two behavior are possible\, according to
whether the graphon is generic or singular. In the latter case\, the limit
ing distributions that appear are non-Gaussian.\n
LOCATION:https://researchseminars.org/talk/WCS/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vishesh Jain (Stanford)
DTSTART;VALUE=DATE-TIME:20210618T130000Z
DTEND;VALUE=DATE-TIME:20210618T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/30
DESCRIPTION:Title: Tow
ards the sampling Lovász Local Lemma\nby Vishesh Jain (Stanford) as p
art of Warwick Combinatorics Seminar\n\n\nAbstract\nFor a constraint satis
faction problem which satisfies the condition of the Lovász local lemma (
LLL)\, the celebrated algorithm of Moser and Tardos allows one to efficien
tly find a satisfying assignment. In the past few years\, much work has go
ne into understanding whether one can efficiently sample from (approximate
ly) the uniform distribution on satisfying assignments under LLL-like cond
itions. I will discuss recent progress on this problem\, joint with Huy Tu
an Pham (Stanford) and Thuy Duong Vuong (Stanford).\n
LOCATION:https://researchseminars.org/talk/WCS/30/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tom Kelly (Birmingham)
DTSTART;VALUE=DATE-TIME:20210625T130000Z
DTEND;VALUE=DATE-TIME:20210625T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/31
DESCRIPTION:Title: A p
roof of the Erdős–Faber–Lovász conjecture\nby Tom Kelly (Birming
ham) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nThe Erdős–
Faber–Lovász conjecture (posed in 1972) states that the chromatic index
of any linear hypergraph on $n$ vertices is at most $n$. In joint work wi
th Dong Yeap Kang\, Daniela Kühn\, Abhishek Methuku\, and Deryk Osthus\,
we proved this conjecture for every sufficiently large $n$. In this talk\,
I will present the history of this conjecture and sketch our proof in som
e special cases.\n
LOCATION:https://researchseminars.org/talk/WCS/31/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nicholas Cook (Duke)
DTSTART;VALUE=DATE-TIME:20210611T130000Z
DTEND;VALUE=DATE-TIME:20210611T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/32
DESCRIPTION:Title: Reg
ularity method and large deviation principles for the Erdős–Rényi hype
rgraph\nby Nicholas Cook (Duke) as part of Warwick Combinatorics Semin
ar\n\n\nAbstract\nIn recent years there has been intense activity on the p
roblem of estimating the upper tail for counts of a fixed subgraph in a sp
arse Erdős–Rényi graph\, combining tools and perspectives from diverse
areas such as extremal graph theory\, statistical physics\, stochastic an
alysis and spectral theory. I will discuss some recent extensions of these
results to the hypergraph setting. Our approach rests on new decompositio
n theorems and counting lemmas for sparse Bernoulli tensors\, extending cl
assic results from the regularity method for dense graphs. These results a
re formulated in terms of a new class of cut-type norms specially tailored
for the sparse setting. Based on joint work with Amir Dembo and Huy Tuan
Pham.\n
LOCATION:https://researchseminars.org/talk/WCS/32/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Will Perkins (Chicago)
DTSTART;VALUE=DATE-TIME:20210702T130000Z
DTEND;VALUE=DATE-TIME:20210702T140000Z
DTSTAMP;VALUE=DATE-TIME:20210804T220117Z
UID:WCS/33
DESCRIPTION:Title: Pol
ymer models\, cluster expansion\, and local limit theorems: counting indep
endent sets in the hypercube\nby Will Perkins (Chicago) as part of War
wick Combinatorics Seminar\n\n\nAbstract\nI'll discuss how local central l
imit theorems can be used in combination with two tools from statistical p
hysics\, polymer models and the cluster expansion\, to asymptotically enum
erate independent sets of a given size in the hypercube. Joint work with M
atthew Jenssen and Aditya Potukuchi (arxiv:2106.09709)\n
LOCATION:https://researchseminars.org/talk/WCS/33/
END:VEVENT
END:VCALENDAR