Events and Activities

Explore current and upcoming events and activities happening at the Institute for Advanced Study.

Mar
31
2025

Computer Science/Discrete Mathematics Seminar I

Improved Private Information Retrieval Schemes from Matching Vectors and Derivatives
Swastik Kopparty
10:30am|Simonyi Hall 101 and Remote Access

Private Information Retrieval (PIR) is a method for a user to interact with t non-colluding servers and read some entry of a database of size n without revealing to the servers anything about which entry of the database was read. After a long line...

Mar
31
2025

Princeton University Gravity Initiative Spring Seminar Series

The Einstein-Euler System with a Physical Vacuum Boundary in Spherical Symmetry
Marcelo Disconzi
12:30pm|Jadwin Hall, Princeton Gravity Initiative, 4th Floor

Abstract: We establish local well-posedness for the Einstein-Euler system with a physical vacuum boundary in spherical symmetry. Our proof relies on a new way of thinking about Einstein’s equations in spherical symmetry that is well-adapted to the...

Mar
31
2025

Members' Colloquium

Selmer Groups and Hilbert's Tenth Problem
1:00pm|Simonyi 101 and Remote Access

Selmer groups are a cohomological tool used to reduce the task of finding solutions of certain diophantine equations to easier field and modular arithmetic. I'll explain how this works in down to earth terms and give some concrete applications...

Mar
31
2025

Princeton University High Energy Theory Seminar

Tensionless AdS3/CFT2 and Single Trace TTbar
Andrea Dei
2:30pm|Jadwin Hall, PCTS Room 407

Abstract: One of the best understood AdS/CFT incarnations relates tensionless k=1 strings on AdS3 to a symmetric product CFT2. I will discuss an exact duality between string theory on a spacetime which is not asymptotically AdS and a non-conformal...

Apr
01
2025

Computer Science/Discrete Mathematics Seminar II

Locally Testable Codes with the Multiplication Property from High-dimensional Expanders
10:30am|Simonyi 101 and Remote Access

A locally testable code (LTC) is an error-correcting code equipped with a tester T that, given an input string x, queries only a small number of positions and rejects x with probability proportional to its distance from the code. Classic examples of...