For more information about this meeting, contact Matthew Katz, James Sellers, George Andrews.
|Title:||Longest Run of Equal Parts in a Random Integer Composition|
|Speaker:||Ayla Gafni, PSU|
|This talk examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive equal parts in a composition of size n. I will discuss symbolic methods for constructing useful generating functions as well as how singularity analysis can be used to determine asymptotic behavior. The problem was posed by Herbert Wilf at the 2009 Analysis of Algorithms conference, and I solved it during a Summer 2009 internship at INRIA-Rocquencourt under the direction of Philippe Flajolet.|
Room Reservation Information
|Date:||11 / 01 / 2011|
|Time:||11:15am - 12:05pm|