The TAU student seminar will be conducted on Mondays, 16-18, Schreiber 309. Pizzas and beers will be served!
Talks will be given by research students based on their areas of interest.
If you are a research student and wish to give a talk in the seminar in 2025-2026, please fill out this form.
Fall Semester 2025-2026
November 3, 2025: Roei Raveh - The fifth operation: modular forms.
Abstract: Modular forms arise in many areas of mathematics, and most prominently in modern number theory. They appear in the proof of Fermat's last theorem, a key ingredient in Viasovska's solution to the packing problem in dimension 8, have a remarkable connection to the Monstrous Moonshine correspondence, and have far-reaching applications in arithmetic and analytic number theory (partitions, Congruences, L-functions, and more).
I will give an introduction to the theory of elliptic modular forms and present an elegant connection to the theory of integral quadratic forms.
If time permits, I will discuss recent results of mine regarding the zeros of modular forms.
No previous knowledge is assumed.
November 10, 2025: Nuha Diab -Super-resolution of near-colliding dirac distributions
Abstract: In this talk, we address the recovery of point sources (modeled as diracs) from bandlimited and noisy Fourier measurements, known as the super-resolution problem. We show how the geometry of the sources affects the stability of reconstruction and present our recent results on optimal error bounds for the super-resolution problem in high dimensions. These bounds are crucial for establishing the optimality of widely used algorithms such as Matrix Pencil and Prony's method.
November 17, 2025: Ilay Hoshen - Large cuts in random graphs
Abstract: Extremal combinatorics studies how large/small a finite set of objects can be if it has to satisfy some certain restrictions. For instance, one may ask: how many edges can a graph on $n$ vertices have if it contains no triangles?
In 1959, Erdős and Rényi introduced a fundamental model of random graphs on $n$ vertices, in which each pair of vertices is joined by an edge independently with probability $p$.
In this talk, we will first discuss some classical results in extremal combinatorics. We will then explore how these ideas interact with random graphs. Finally, if time permits, we will look at what is known about the largest bipartite subgraphs (max-cuts) of random graphs.
November 24, 2025: Tomer Konforty - TBA
Abstract:
December 1, 2025: Vivian Bar Nir - TBA
Abstract:
December 8, 2025: Rei Henigman - TBA
Abstract:
December 15, 2025: Oded Elisha - TBA
Abstract:
December 22, 2025: Tomer Milo - TBA
Abstract:
December 29, 2025: Shay Sadovsky - TBA
Abstract:
January 5, 2025: Aviad Hasdiel - TBA
Abstract:
January 12, 2025: Shai Zucker - TBA
Abstract:
January 19, 2025: Arnon Shur - TBA
Abstract: