This seminar runs every Monday during the semester at 2PM in Hill 705. The current organizers are Jeff Kahn, Bhargav Narayanan, Swee Hong Chan, and Caleb Fong.
If you wish to join our listserv, please email Caleb Fong at cjf180@math.rutgers.edu.
Click here for the abstract archive for this semester, and here for older abstracts.
Next Talk:
Date: October 26, 2026 at 2:00pm
Speaker: Varun Sivashankar (Princeton)
Title: Zero Sum Cycles in Digraphs.
Abstract: Suppose G is a d-regular digraph. How large does d need to be to guarantee the existence of a directed cycle with length divisible by k? We prove that d >= 25k suffices. The previous best bound was roughly d >= k log k by Alon and Linial using the local lemma. Our proof generalizes a determinant-permanent framework introduced by Friedland. We will discuss the proof of the main result and mention some extensions to zero sum cycle packing.
October 26 - Varun Sivashankar
November 2 - Robin Pemantle
November 9 - Ben Gillott