Combinatorics and Geometry Learning Seminar

We started a new learning seminar for anyone interested in doing a deep dive into combinatorics and geometry.  It will be in-person with a zoom option.

FALL 2026 TALKS

Day and Time: Fridays at 10:00 am  (in person)

Room: Graduate Center Room 9116 (same room as the New Yor Combinatorics Seminar)

This is an in-person seminar, but we offer zoom in case you cannot make it.

https://us06web.zoom.us/j/86767834329?pwd=tEAmfazr6vTkHTju8FIgqu2jKYOFsr.1

Meeting ID: 867 6783 4329

Passcode: 113325

Speaker: Jinyoung Park (New York University)

Title: Asymptotic enumeration via graph containers and entropy

Dates: Fri Sep 18 and 25

Time: 10:00 am - 11:30 am

Location: 9116 Graduate Center

Modality: In-person

Abstract: The container methods are powerful tools to bound the number of independent sets of graphs and hypergraphs, and they have been extremely influential in the area of extremal and probabilistic combinatorics. Entropy, first introduced by Shannon (1948) in the area of information theory, is a measure of the expected amount of information contained in a random variable. Entropy has seen lots of fascinating applications in a wide range of enumeration problems. In these introductory lectures, we will demonstrate how to count independent sets in regular graphs using each of these techniques, offering a concrete look at how both tools can be applied to achieve the same asymptotic results.

Previous Semesters

Spring 2026