Return to search

Multivariate finite operator calculus applied to counting ballot paths containing patterns [electronic resource]

Counting lattice paths where the number of occurrences of a given pattern is monitored requires a careful analysis of the pattern. Not the length, but the characteristics of the pattern are responsible for the difficulties in finding explicit solutions. Certain features, like overlap and difference in number of ! and " steps determine the recursion formula. In the case of ballot paths, that is paths the stay weakly above the line y = x, the solutions to the recursions are typically polynomial sequences. The objects of Finite Operator Calculus are polynomial sequences, thus the theory can be used to solve the recursions. The theory of Finite Operator Calculus is strengthened and extended to the multivariate setting in order to obtain solutions, and to prepare for future applications. / by Shaun Sullivan. / Thesis (Ph.D.)--Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web.

Identiferoai:union.ndltd.org:fau.edu/oai:fau.digital.flvc.org:fau_3673
ContributorsSullivan, Shaun, Charles E. Schmidt College of Science, Department of Mathematical Sciences
PublisherFlorida Atlantic University
Source SetsFlorida Atlantic University
LanguageEnglish
Detected LanguageEnglish
TypeText, Electronic Thesis or Dissertation
Formatvii, 91 p. : ill., electronic
Rightshttp://rightsstatements.org/vocab/InC/1.0/

Page generated in 0.0016 seconds