BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Petér Pál Pach (Budapest University of Technology and Economics)
DTSTART:20201207T140000Z
DTEND:20201207T150000Z
DTSTAMP:20260423T035542Z
UID:EPC/37
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/37/">Avo
 iding arithmetic progressions or right angles</a>\nby Petér Pál Pach (Bu
 dapest University of Technology and Economics) as part of Extremal and pro
 babilistic combinatorics webinar\n\n\nAbstract\nIn this talk we discuss so
 me bounds about sets avoiding certain arithmetic or geometric configuratio
 ns in $F_p^n$ (or more generally\, in $Z_m^n$). In particular\, we will co
 nsider the case of 6-term arithmetic progressions in $Z_6^n$\, and sets av
 oiding right angles in $F_p^n$. Our methods can also be used to bound the 
 maximum possible size of a binary code where no two codewords have Hamming
  distance divisible by a fixed prime p.  \n\nJoint work with Palincza and 
 with Bursics\, Matolcsi and Schrettner.\n
LOCATION:https://researchseminars.org/talk/EPC/37/
END:VEVENT
END:VCALENDAR