Seminars

The Theoretical Computer Science and Discrete Mathematics Seminars will take place every Monday at 11:00 a.m. - 12:00 p.m. and every Tuesday at 10:30 a.m. - 12:30 p.m. at the Institute for Advanced Study. The lectures will be held in S-101, the seminar room in Simonyi Hall, unless stated otherwise.

If you are interested in attending future seminars and are not already on our mailing list from previous years, please send an e-mail to Andrea Lass and ask to be added.

alass email

 

Upcoming Seminar Titles Include:

Apr
22
2024

Computer Science/Discrete Mathematics Seminar I

Additive Combinatorics Without Groups
Huy Tuan Pham
11:00am|Simonyi 101 and Remote Access

Subsets $A$ of an abelian group with a small doubling $|A+A|/|A|$ have been extensively studied, and results of Freiman, Ruzsa and Green give fundamental structural descriptions of such sets. These have important applications across combinatorics...

Apr
23
2024

Computer Science/Discrete Mathematics Seminar II

Random Cayley Graphs From a Combinatorial Perspective
Huy Tuan Pham
10:30am|Simonyi Hall 101 and Remote Access

Cayley graphs provide interesting bridges between graph theory, additive combinatorics and group theory. Fixing an ambient finite group, random Cayley graphs are constructed by choosing a generating set at random. These graphs reflect interesting...

Apr
29
2024

Computer Science/Discrete Mathematics Seminar I

Lower Bounds for Set-Multilinear Branching Programs
Shubhangi Saraf
11:00am|Simonyi 101 and Remote Access

In this talk, I will discuss lower bounds for a certain set-multilinear restriction of algebraic branching programs. The significance of the lower bound and the model is underscored by the recent work of Bhargav, Dwivedi, and Saxena (2023), which...

Apr
30
2024

Computer Science/Discrete Mathematics Seminar II

Incidence Bounds via Extremal Graph Theory
Istvan Tomon
10:30am|Simonyi Hall 101 and Remote Access

A cornerstone result in geometry is the Szemerédi–Trotter theorem, which gives a sharp bound on the maximum number of incidences between $m$ points and $n$ lines in the real plane. A natural generalization of this is to consider point-hyperplane...