"Combinatorial Unification of Binomial-Like Arrays" by James Stephen Lindsay
 

Doctoral Dissertations

Date of Award

5-2010

Degree Type

Dissertation

Degree Name

Doctor of Philosophy

Major

Mathematics

Major Professor

Carl G. Wagner

Committee Members

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.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."

Plum Print visual indicator of research metrics
PlumX Metrics
  • Usage
    • Abstract Views: 15953
    • Downloads: 10580
  • Mentions
    • References: 4
see details

Share

COinS