BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
 M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20231208T164029Z
DTSTART:20231213T151500Z
DTEND:20231213T161500Z
SUMMARY:Logic seminar: Aris Papadopoulos (University of Leeds)
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}d2dc-lpi6g3
 2v-drlxnq
DESCRIPTION:Title: Zarankiewicz’s Problem and Model Theory\n\nAbstract: A
  shower thought that anyone interested in graph theory must have had at 
 some point in their lives is the following: `How “sparse" must a given g
 raph be\, if I know that it has no “dense” subgraphs?’. This curiosity d
 efinitely crossed the mind of Polish mathematician K. Zarankiewicz\, who
  asked a version of this question formally in 1951. In the years that fo
 llowed\, many central figures in the development of extremal combinatori
 cs contemplated this problem\, giving various kinds of answers. Some of 
 these will be surveyed in the first part of my talk.\n\nSo far so good\,
  but this is a logic seminar and the title says the words “Model Theory"
 … In the second part of my talk\, I will discuss how the celebrated Szem
 erédi-Trotter theorem gave a starting point to the study of Zarankiewicz
 ’s problem in “geometric” contexts\, and how the language of model theor
 y has been able to capture exactly what these contexts are. I will then 
 ramble about improvements to the classical answers to Zarankiewicz’s pro
 blem\, when we restrict our attention to semilinear/semibounded o-minima
 l structures\, Presburger arithmetic\, and various kinds of Hrushovski c
 onstructions. \n\nThe new results that will appear in the talk were obta
 ined jointly with Pantelis Eleftheriou.\n
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Frank Adams 1 (and zoom\, link in email)\, Alan Turing Building\
 , Manchester
END:VEVENT
END:VCALENDAR