CMU Campus
Department of         Mathematical Sciences
Events People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department Alumni
Algorithms, Combinatorics and Optimization Seminar
Paata Ivanisvili
Princeton University
Title: Number of disjoint partitions

Abstract: Let X be a finite collection of sets. Given n>1 what is the maximal number of ways disjoint union of n sets (elements from X) is again a set in X? I will show you how to find good bounds of this quantity in terms of n and the cardinality of X.

Date: Thursday, March 22, 2018
Time: 3:30 pm
Location: Wean Hall 8220
Note: Before the talk, at 3:10 pm, there will be tea and cookies in Wean Hall 6220.