Combinatorial Unification of Binomial-Like Arrays
Date Issued
May 1, 2010
Author(s)
Lindsay, James Stephen
Advisor(s)
Carl G. Wagner
Additional Advisor(s)
Pavlos Tzermias
Xia Chen
Gina Pighetti
Abstract
This research endeavors to put a common combinatorial ground under several binomiallike arrays, including the binomial coefficients, q-binomial coefficients, Stirling numbers, q-Stirling numbers, cycle numbers, and Lah numbers, by employing symmetric polynomials and related words with specialized alphabets as well as a balls-and-urns counting approach. Using the method of statistical generating functions, q- and p; q-generalizations of the binomial coefficients, Stirling numbers, cycle numbers, and Lah numbers are all discussed as well, unified under a single general triangular array that is herein referred to as the array of Comtet-Lancaster numbers.
Degree
Doctor of Philosophy
Major
Mathematics
Embargo Date
December 1, 2011
File(s)![Thumbnail Image]()
Name
JLindsayDissFinal.pdf
Size
482.98 KB
Format
Adobe PDF
Checksum (MD5)
23418e7a0dc815187444c4a9a9aa9485