Media Summary: Mehtaab Sawhney (MIT) Beyond the Boolean Cube We ... It is our pleasure to share the Big Seminar talk " Let ξ be a non-constant real-valued random variable with finite support, and let Mn(ξ) denote an n×n random matrix with entries ...

On Perfectly Friendly Bisections Of - Detailed Analysis & Overview

Mehtaab Sawhney (MIT) Beyond the Boolean Cube We ... It is our pleasure to share the Big Seminar talk " Let ξ be a non-constant real-valued random variable with finite support, and let Mn(ξ) denote an n×n random matrix with entries ... Enumerating Matroids and Linear Spaces (18 Jan 2022) Computer Science/Discrete Mathematics Seminar I Topic: Communication and Query Complexity of Bipartite Nikhil Bansal (University of Michigan) The Role of ...

Andrew Reece's talk at BSC 2025 about useful patterns in bits, bytes and code, and how he arrived at the Xar data structure. Valentine Kabanets (Simon Fraser University) IBS ECOPRO Online Seminar Mehtaab Sawhney, Anticoncentration in Ramsey graphs ... A lecture by Susan S. Fainstein who is a Senior Research Fellow in the Harvard Graduate School of Design. We give deterministic approximate counting algorithms for the number of matchings and independent sets of a given size in ... Instructor: Alberto Bressan (The Pennsylvania State University) Date: May 5, 2026 Thematic Program on Shocks and Singularities: ...

Photo Gallery

On Perfectly Friendly Bisections of Random Graphs
Ashwin Sah (MIT),  Friendly bisections of random graphs
Matthew Kwan "Friendly bisections of random graphs" | Big Seminar
Ashwin Sah and Mehtaab Sawhney   Singularity of discrete random matrices
Graphs and Matroids Seminar - Mehtaab Sawhney
Communication and Query Complexity of Bipartite Perfect Matching - Yuval Efron
On the Komlós Conjecture
Andrew Reece – Assuming as Much as Possible – BSC 2025
The Power of Distinguishing Simple From Random (Part II)
2022.09.21, Mehtaab Sawhney, Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conj
The Argument for Just Outcomes - Susan Fainstein
Mehtaab Sawhney: Approximate counting and sampling via local central limit theorems (MIT)
View Detailed Profile
On Perfectly Friendly Bisections of Random Graphs

On Perfectly Friendly Bisections of Random Graphs

Mehtaab Sawhney (MIT) https://simons.berkeley.edu/talks/mehtaab-sawhney-mit-2023-06-30 Beyond the Boolean Cube We ...

Ashwin Sah (MIT),  Friendly bisections of random graphs

Ashwin Sah (MIT), Friendly bisections of random graphs

Speaker: Ashwin Sah (MIT), Title:

Matthew Kwan "Friendly bisections of random graphs" | Big Seminar

Matthew Kwan "Friendly bisections of random graphs" | Big Seminar

It is our pleasure to share the Big Seminar talk "

Ashwin Sah and Mehtaab Sawhney   Singularity of discrete random matrices

Ashwin Sah and Mehtaab Sawhney Singularity of discrete random matrices

Let ξ be a non-constant real-valued random variable with finite support, and let Mn(ξ) denote an n×n random matrix with entries ...

Graphs and Matroids Seminar - Mehtaab Sawhney

Graphs and Matroids Seminar - Mehtaab Sawhney

Enumerating Matroids and Linear Spaces (18 Jan 2022)

Communication and Query Complexity of Bipartite Perfect Matching - Yuval Efron

Communication and Query Complexity of Bipartite Perfect Matching - Yuval Efron

Computer Science/Discrete Mathematics Seminar I Topic: Communication and Query Complexity of Bipartite

On the Komlós Conjecture

On the Komlós Conjecture

Nikhil Bansal (University of Michigan) https://simons.berkeley.edu/talks/nikhil-bansal-university-michigan-2026-05-28 The Role of ...

Andrew Reece – Assuming as Much as Possible – BSC 2025

Andrew Reece – Assuming as Much as Possible – BSC 2025

Andrew Reece's talk at BSC 2025 about useful patterns in bits, bytes and code, and how he arrived at the Xar data structure.

The Power of Distinguishing Simple From Random (Part II)

The Power of Distinguishing Simple From Random (Part II)

Valentine Kabanets (Simon Fraser University) https://simons.berkeley.edu/talks/power-distinguishing-simple-random-part-ii ...

2022.09.21, Mehtaab Sawhney, Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conj

2022.09.21, Mehtaab Sawhney, Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conj

IBS ECOPRO Online Seminar https://dimag.ibs.re.kr/event/2022-09-21/ Mehtaab Sawhney, Anticoncentration in Ramsey graphs ...

The Argument for Just Outcomes - Susan Fainstein

The Argument for Just Outcomes - Susan Fainstein

A lecture by Susan S. Fainstein who is a Senior Research Fellow in the Harvard Graduate School of Design.

Mehtaab Sawhney: Approximate counting and sampling via local central limit theorems (MIT)

Mehtaab Sawhney: Approximate counting and sampling via local central limit theorems (MIT)

We give deterministic approximate counting algorithms for the number of matchings and independent sets of a given size in ...

On the behavior of approximate solutions to conservation laws near singularities.

On the behavior of approximate solutions to conservation laws near singularities.

Instructor: Alberto Bressan (The Pennsylvania State University) Date: May 5, 2026 Thematic Program on Shocks and Singularities: ...