The ACO Seminar (2023–2024)

Recent breakthroughs in combinatorics, especially on bounds of sizes of sets avoiding particular configurations, have been afforded by the slice-rank and partition-rank methods. In this talk we introduce these concepts and the challenges that arise when using them, in hopes that audience members have access to a new tool they may find useful in their own work. Furthermore we discuss the work of the speaker in integrating partition lattices into the theory.