|
Activity Number:
|
255
- Contributed Poster Presentations: Section on Statistical Computing
|
|
Type:
|
Contributed
|
|
Date/Time:
|
Monday, July 29, 2019 : 2:00 PM to 3:50 PM
|
|
Sponsor:
|
Section on Statistical Computing
|
|
Abstract #305082
|
|
|
Title:
|
Asymptotic Analysis of Wilf Partitions Using Generating Functions
|
|
Author(s):
|
Kevin LaMaster* and Mark Ward
|
|
Companies:
|
and Purdue University
|
|
Keywords:
|
Generating Functions;
Partitions;
Asymptotic;
Combinatorics
|
|
Abstract:
|
Generating functions are a useful tool that helps enables us to embed information from a series into a concise function. A few examples include moment generating functions where the power series representation of our function has the nth moment as the nth coefficient. Or probability generating functions where the nth coefficient is the probability our distribution equals n. From there we can use analytical methods to find characteristics of the function that will give us information on our original series. In this specific example we want to embed and then analyze the asymptotic size of Wilf Partitions, the sixth of the eight unsolved problems on Wilf's webpage. Wilf Partitions are a special type of integer partition where each non-zero multiplicity of its parts is distinct.
|
Authors who are presenting talks have a * after their name.
