Finding a solution to the Erdős-Ginzburg-Ziv theorem

Add to your list(s) Download to your calendar using vCal

• Arvin Leung (Cambridge)
• Thursday 29 May 2025, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

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 divisible 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 that a specific variant of boolean convolution can be implemented in time faster than the usual O(nlog n) expected from FFT -based methods.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.