Computer Science & Discrete Mathematics (CSDM)

Computer Science & Discrete Mathematics (CSDM) Seminar

A weekly seminar on topics in theoretical computer science and discrete mathematics

Time: Every Monday 11:00 AM-12:00 PM, and Tuesday 10:30 AM-12:30 PM,   Place: Simonyi 101

Information about CSDM

Upcoming Talk

Speaker: Amir Abboud, Weizmann Institute of Science
When: Tuesday, January 20, 2026 | 10:30 AM EST
Where: Simonyi 101 and Remote Access
Add to calendar 01/20/2026 10:3001/20/2026 11:30America/New_YorkComputer Science/Discrete Mathematics Seminar IIuse-titleSpeakers: Amir Abboud, Weizmann Institute of Science More: https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-seminar-ii-608 Simonyi 101 and Remote Accessa7a99c3d46944b65a08073518d638c23

Upcoming Schedule

Tuesday, Jan 20, 2026 | 11:30am
Or Zamir, Tel Aviv University
Abstract
View additional event details
Add to calendar Tuesday, 2026-01-20 11:30Tuesday, 2026-01-20 12:30America/New_YorkComputer Science/Discrete Mathematics Seminar IIuse-titleSpeakers: Or Zamir, Tel Aviv University More: https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-seminar-ii-609 Simonyi 101 and Remote Accessa7a99c3d46944b65a08073518d638c23
Monday, Jan 26, 2026 | 11:00am
Noah Singer, Carnegie Mellon University
Abstract
View additional event details
Add to calendar Monday, 2026-01-26 11:00Monday, 2026-01-26 12:00America/New_YorkComputer Science/Discrete Mathematics Seminar Iuse-titleSpeakers: Noah Singer, Carnegie Mellon University More: https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-seminar-i-612 Simonyi Hall 101 and Remote Accessa7a99c3d46944b65a08073518d638c23
Monday, Feb 02, 2026 | 11:00am
Benjamin Sudakov, ETH Zürich
Disjoint Pairs in Set Systems and the Combinatorics of Low-Rank Matrices
Abstract

In this talk, I will discuss the solution to several problems in two closely related settings: set families in 2^[n] with many disjoint pairs, and low-rank matrices with many zero entries.

Highlights include a resolution of an old question of Daykin and Erdős on the maximum number of disjoint set pairs, a proof of a conjecture by Singer and Sudan motivated by the log-rank conjecture in communication complexity, and tight bounds for a problem posed by Alon, Gilboa, and Gueron related to a long-standing question in coding theory about cover-free families.

Our proofs use probabilistic, entropy, and discrepancy methods, revealing connections to additive combinatorics and coding theory.

Joint with Z. Hunter, A. Milojević and I. Tomon.

View additional event details
Add to calendar Monday, 2026-02-02 11:00Monday, 2026-02-02 12:00America/New_YorkComputer Science/Discrete Mathematics Seminar Iuse-titleTopic: Disjoint Pairs in Set Systems and the Combinatorics of Low-Rank Matrices Speakers: Benjamin Sudakov, ETH Zürich More: https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-seminar-i-613 In this talk, I will discuss the solution to several problems in two closely related settings: set families in 2^[n] with many disjoint pairs, and low-rank matrices with many zero entries. Highlights include a resolution of an old question of Daykin and Erdős on the maximum number of disjoint set pairs, a proof of a conjecture by Singer and Sudan motivated by the log-rank conjecture in communication complexity, and tight bounds for a problem posed by Alon, Gilboa, and Gueron related to a long-standing question in coding theory about cover-free families. Our proofs use probabilistic, entropy, and discrepancy methods, revealing connections to additive combinatorics and coding theory. Joint with Z. Hunter, A. Milojević and I. Tomon. Simonyi Hall 101 and Remote Accessa7a99c3d46944b65a08073518d638c23
More Events

Past Seminars Archive

Dec
09
2025

Computer Science/Discrete Mathematics Seminar II

On Turán Numbers of Tight Cycles
Maya Sankar
10:30am|Simonyi 101 and Remote Access

The study of Turán numbers of graphs and hypergraphs is a rich problem in extremal combinatorics. The Turán problem asks, given a fixed forbidden (hyper)graph F, what is the maximum number of edges in an F-free (hyper)graph in terms of the number of...

Dec
08
2025

Computer Science/Discrete Mathematics Seminar I

Trickle-down Theorems for High-dimensional Expanders via Lorentzian Polynomials
Jonathan Leake
11:00am|Simonyi Hall 101 and Remote Access

High-dimensional expanders (HDX) are a generalization of expander graphs which have seen various applications in coding theory, PCPs, pseudorandomness, derandomization, approximate sampling, and beyond. One technique for proving a complex is an HDX...

Dec
02
2025

Computer Science/Discrete Mathematics Seminar II

Linial-Meshulam Complexes 2
Michael Chapman
10:30am|Simonyi 101 and Remote Access

Last week we defined the Linial--Meshulam model for random 2 dimensional simplicial complexes and discussed two notions of connectivity for it: Vanishing of its 1st cohomology with F2 coefficients, and vanishing of its fundamental group. This time...

More Events

Information About CSDM