08/06/2015, 15:00 — 16:00 — Room 6.2.38, Faculty of Sciences of the Universidade de Lisboa
Mike Weiner, Pennsylvania State University
Enumeration through partial Bell polynomials
We give a brief introduction to partial Bell polynomials and discuss how they can be used to enumerate trees, paths and polygon partitions. In this talk we will focus on finding the total number of colored partitions of a convex polygon by non-intersecting diagonals into convex polygons with prescribed properties. We give explicit examples and discuss how this approach unifies several known results.
TIME CHANGE: MONDAY, 3pm!