Uploaded November 2026 | Updated November 2026, 3 days ago
Institute for Advanced Study / Princeton University Joint Astrophysics Colloquium
Topic: The Triple Connection: Black Hole Mergers, Electromagnetic Counterparts, and Galactic Black Holes
Speaker: Smadar Naoz
Affiliation: University of California, Los Angeles
Date: November 03, 2026
Wolfensohn Hall
Black holes are detected through a variety of methods, each revealing a different part of their nature. These include gravitational-wave emissions that detect compact-object binary mergers, X-ray radiation that captures dramatic accretion episodes in black hole binaries, and astrometry, which measures the dance of a star around an unseen companion. Despite significant progress over the past decade, we still lack a unified framework that connects these seemingly disparate populations. In this talk, I will explore how stellar triples may provide such a connection. I will discuss the role of tertiary companions in driving black hole mergers detectable by LIGO–Virgo–KAGRA, in shaping the formation of accreting X-ray binaries, and in leaving behind wide black hole–stellar systems like those now revealed by Gaia. I will show how the aftermath of a black hole merger in the presence of a tertiary companion can produce rare but detectable electromagnetic counterparts, and how this channel may account for a significant fraction of observed black hole binaries. In short, triples may open the door to linking gravitational-wave events with electromagnetic counterparts and galactic black holes, offering a new way to piece together the life stories of black holes.
Institute for Advanced Study / Princeton University Joint Astrophysics Colloquium
Topic: The Triple Connection: Black Hole Mergers, Electromagnetic Counterparts, and Galactic Black Holes
Speaker: Smadar Naoz
Affiliation: University of California, Los Angeles
Date: November 03, 2026
Wolfensohn Hall
Black holes are detected through a variety of methods, each revealing a different part of their nature. These include gravitational-wave emissions that detect compact-object binary mergers, X-ray radiation that captures dramatic accretion episodes in black hole binaries, and astrometry, which measures the dance of a star around an unseen companion. Despite significant progress over the past decade, we still lack a unified framework that connects these seemingly disparate populations. In this talk, I will explore how stellar triples may provide such a connection. I will discuss the role of tertiary companions in driving black hole mergers detectable by LIGO–Virgo–KAGRA, in shaping the formation of accreting X-ray binaries, and in leaving behind wide black hole–stellar systems like those now revealed by Gaia. I will show how the aftermath of a black hole merger in the presence of a tertiary companion can produce rare but detectable electromagnetic counterparts, and how this channel may account for a significant fraction of observed black hole binaries. In short, triples may open the door to linking gravitational-wave events with electromagnetic counterparts and galactic black holes, offering a new way to piece together the life stories of black holes.



![Top-Down Lower Bounds for Bounded Depth Circuits - Oliver Korten
Computer Science/Discrete Mathematics Seminar II
10:30am|Simonyi Hall 101 and Remote Access
Topic: Top-Down Lower Bounds for Bounded Depth Circuits
Speaker: Oliver Korten
Affiliation: Institute for Advanced Study
Date: October 13, 2026
A cornerstone result in complexity theory is that O(1)-depth circuits with unbounded fan-in AND/OR gates computing the parity of an n bit string must have exp(n) size. Two completely different proofs of this are known, both dating back to the 1980s; the first is based on the method of random restrictions, and the second on approximation by low-degree polynomials. Motivated by Karchmer and Wigdersons communication complexity program for proving lower bounds against super-logarithmic depth circuits (a central problem which remains wide open), Hastad, Jukna, and Pudlak set out in search of a THIRD proof of the lower bound for parity, one which can be framed in the language of communication complexity and which reasons from the top of the circuit downwards. We present the first such proof. The underlying combinatorics center around the following problem: if X is a high entropy random variable in {0,1}^n, and R is a random small subset of [n], in what sense will X_R typically resemble the uniform distribution? Top-Down Lower Bounds for Bounded Depth Circuits - Oliver Korten](https://i.ytimg.com/vi/kZWMxVO2Ecw/mqdefault.jpg)






