University of Cambridge > Talks.cam > Combinatorics Seminar > Finding a solution to the Erdős-Ginzburg-Ziv theorem

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

Download to your calendar using vCal

  • UserArvin Leung (Cambridge)
  • ClockThursday 29 May 2025, 14:30-15:30
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Jesus College JCR Potter room / https://cam-ac-uk.zoom.us/j/89259699528?pwd=rI2WS21NUsIKMmZCGtkPuPbM5SL0eW.1

Other talks

Group Work Strange New Worlds The Neurophenomenology of Surrender: Agency, Renewal, and Social Engagement in Speaking in Tongues Illegal trade in the North Atlantic Coming soon Quantum graphs with a time asymmetry: spectral optimization and spectral statistics
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity