BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Finding a solution to the Erdős-Ginzburg-Ziv theorem - Arvin Leun
 g (Cambridge)
DTSTART:20250529T133000Z
DTEND:20250529T143000Z
UID:TALK232135@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:he Erdős-Ginzburg-Ziv theorem states that for any sequence of
  2n-1 integers\, there exists a subsequence of n elements whose sum is div
 isible by n. In this article\, we provide a simple\, practical O(nlog log 
 n) algorithm and a theoretical O(nlog log log n) algorithm\, both of which
  improve upon the best previously known O(nlog n) approach. This shows tha
 t a specific variant of boolean convolution can be implemented in time fas
 ter than the usual O(nlog n) expected from FFT-based methods.
LOCATION:MR12
END:VEVENT
END:VCALENDAR