BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:** POSTPONED **   Linear configurations containing 4-term arithmet
 ic progressions are uncommon   - Leo Versteegen (Cambridge)
DTSTART:20220127T143000Z
DTEND:20220127T153000Z
UID:TALK169091@talks.cam.ac.uk
CONTACT:HoD Secretary\, DPMMS
DESCRIPTION:A linear configuration is called common (in $\\mathbb{F}_p^n$)
  if every 2-coloring of $\\mathbb{F}_p^n$ yields at least the number of mo
 nochromatic instances of a randomly chosen coloring. Saad and Wolf asked w
 hether\, analogously to a result by Thomason in graph theory\, every confi
 guration containing a 4-term arithmetic progression is uncommon. I will sk
 etch a proof confirming that this is the case and discuss some of the diff
 iculties in finding a full characterisation of common configurations.
LOCATION:MR12
END:VEVENT
END:VCALENDAR