BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Alexander Razborov (Chicago)
DTSTART:20210122T173000Z
DTEND:20210122T183000Z
DTSTAMP:20260423T003231Z
UID:WCS/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/16/">The
 ons and quasirandomness</a>\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
END:VCALENDAR