Demo Section: Dynamic Block
The Dynamic Block section is a powerful tool for content editors. It allows you to embed a dynamically updating list of content, such as a list of upcoming events or latest articles. Each "Block" option has it's own configuration options.
Events – Upcoming
From Analyticity to Phenomenology
8:00am|Princeton University, PCTS, Jadwin Hall & IAS Wolfensohn Hall
Organizers:
Jan Albert (PCTS); Nima Arkani-Hamed (IAS); Sebastian Mizera
(Princeton/Columbia); Olivier Simon (PCTS)
Registration has reached full capacity, but
individual lectures may be attended at IAS.
January 12-14: will be held at PCTS through...
Studying 3D CFTs with the Fuzzy Sphere: Chern-Simons-Matter Theories and Fermionic CFTs
Zheng Zhou
2:30pm|Bloomberg Lecture Hall (IAS) & Zoom
Abstract: Conformal field theories in 3D are
central to condensed-matter and high-energy physics. Among them,
critical gauge theories, especially Chern-Simons-matter theories,
stand out: They describe transitions where one or both phases
are...
From Analyticity to Phenomenology
8:00am|Princeton University, PCTS, Jadwin Hall & IAS Wolfensohn Hall
Organizers:
Jan Albert (PCTS); Nima Arkani-Hamed (IAS); Sebastian Mizera
(Princeton/Columbia); Olivier Simon (PCTS)
Registration has reached full capacity, but
individual lectures may be attended at IAS.
January 12-14: will be held at PCTS through...
Events - Previous
On Turán Numbers of Tight Cycles
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...
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...
Linial-Meshulam Complexes 2
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...
Upcoming Talk
Speaker:
Amir Abboud, Weizmann Institute of Science
When:
Tuesday, January 20, 2026 | 10:30 AM EST
Where: Simonyi 101 and Remote Access
Upcoming Schedule
Monday, Feb 02, 2026 | 11:00am
Benjamin Sudakov, ETH Zürich
Disjoint Pairs in Set Systems and the Combinatorics of Low-Rank Matrices
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.
News - Latest Dynamic Block
Proin nibh magna, euismod quis libero vel, consectetur faucibus
metus. Fusce pretium mattis lectus, id scelerisque urna vestibulum
quis. In vitae odio tortor. Praesent at maximus lectus. Maecenas
pharetra suscipit lacus quis blandit. Pellentesque...
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Cras
commodo placerat blandit. Proin id nulla a mi suscipit pharetra.
Cras fringilla nec nibh vitae hendrerit. Nam et dolor tristique,
pretium mi ac, semper quam. Quisque vel congue est, sit...
Related Content by Tag Dynamic Block
