BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:configurations containing 4-term arithmetic progressions are uncom
 mon  - Leo Versteegen (Cambridge)
DTSTART:20220210T160000Z
DTEND:20220210T170000Z
UID:TALK169946@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:A linear configuration is called common (in $\\mathbb{F}_pn$) 
 if every 2-coloring of $\\mathbb{F}_pn$ yields at least the number of mono
 chromatic instances of a randomly chosen coloring. Saad and Wolf asked whe
 ther\, analogously to a result by Thomason in graph theory\, every configu
 ration containing a 4-term arithmetic progression is uncommon. I will sket
 ch a proof confirming that this is the case and discuss some of the diffic
 ulties in finding a full characterisation of common configurations
LOCATION:CMS MR5
END:VEVENT
END:VCALENDAR