Enumeration Through Partial Bell Polynomials
Speaker: Mike Weiner, PSU Altoona
Abstract: 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 unies several known results.
Room Reservation Information
Room Number: 106 McAllister
Time: 11:15am - 12:05pm