Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
Let X be a finite collection of sets. I will speak about how to efficiently count the number of ways that a union of n disjoint elements of X is also an element of X.
We will estimate this number from above in terms of n and the cardinality of X.
No Notes/Supplements Uploaded
No Video Files Uploaded