Events

Upcoming Events

Date:
9
December
2024
Hour: 11:15 - 13:00
Elaine and Bram Goldsmith Building, Room 208

Dye's Theorem and the uniqueness of hyperfinite equivalence relations

Midrasha on Groups Seminar
Liam Hanany
Weizmann

I will discuss Dye's Theorem and the uniqueness of hyperfinite equivalence relations following mostly [Kerr-Li] Section 4.9.

For more details and the exact reference, click here.  

The seminar will be frontal and also on Zoom
Date:
9
December
2024
Hour: 14:15 - 16:00
Ziskind Building, Lecture Hall - Room 1

On the quantum unique ergodicity conjecture for hyperbolic arithmetic manifolds

Midrasha on Groups Seminar
Zvi Shem-Tov
IAS

Suppose $u_j$ is an orthonormal basis of eigenfunctions of the Laplacian on a compact Riemannian manifold, and consider the probability measures $|u_j|^2 dvol$. The quantum ergodicity theorem of Shnir

The seminar will be frontal and also on Zoom
Date:
12
December
2024
Hour: 13:30 - 14:30
Ziskind Building, Room 155

Lower tails for triangles inside the critical window

Geometric Functional Analysis and Probability Seminar
Michael Simkin
MIT

How likely is $G(n;p)$ to have a less-than-typical number of triangles? This is a foundational question in non-linear large deviation theory. When $p \ll 1/\sqrt{n}$ or $p \gg 1/\sqrt{n}$ the answer is

Date:
16
December
2024
Hour: 11:15 - 12:15
Ziskind Building, Room 1

Accountability in Threshold Cryptography

Foundations of Computer Science Seminar
Lior Rotem
Stanford

Threshold cryptography has been fundamental to secure distributed protocols for over three decades. However, it often comes at the expense of accountability: when secret information is shared among mu

Date:
19
December
2024
Hour: 13:30 - 14:30
Ziskind Building, Room 155

TBD

Geometric Functional Analysis and Probability Seminar
Sasha Fish
Sydney

TBD

Date:
26
December
2024
Hour: 12:15 - 13:15
Ziskind Building, Room 1

Discovering and Erasing Undesired Concepts

Vision and AI
Niv Cohen
NYU

The rapid growth of generative models allows an ever-increasing variety of capabilities. Yet, these models may also produce undesired content such as unsafe images, private information, or copyrighted

Date:
2
January
2025
Hour: 13:30 - 14:30
Ziskind Building, Room 155

TBD

Geometric Functional Analysis and Probability Seminar
Shlomo Hoory
Tel-Hai
Date:
9
January
2025
Hour: 13:30 - 14:30
Ziskind Building,

TBD

Geometric Functional Analysis and Probability Seminar
Snir Ben Ovadia
PSU

TBD

Date:
16
January
2025
Hour: 13:30 - 14:30
Ziskind Building, Room 155

TBD

Geometric Functional Analysis and Probability Seminar
Rami Atar
Technion

TBD

Date:
3
February
2025
Hour: 11:15 - 12:15
Ziskind Building, Room 1

Vizing's Theorem in Near-Linear Time

Foundations of Computer Science Seminar
Shay Solomon
TAU

Vizing's Theorem from 1964 states that any n-vertex m-edge graph of maximum degree Δ can be edge colored using at most Δ+1 different colors.

Vizing's original proof is algorithmic and implies that

Date:
10
February
2025
Hour: 11:15 - 12:15
Ziskind Building, Room 1

Abundant resources can trigger reduced consumption: Unveiling the paradox of excessive scrounging

Foundations of Computer Science Seminar
Amos Korman
Haifa University

"In the 2004 Olympics, the US national basketball team failed to win the gold medal despite featuring superstars such as LeBron James. This event raises a fundamental question: Why do teams with highly

Past Events