You are here
Multivariate finite operator calculus applied to counting ballot paths containing patterns [electronic resource]
| Title: | Multivariate finite operator calculus applied to counting ballot paths containing patterns [electronic resource]. |
 83 views 29 downloads |
|---|---|---|
| Name(s): |
Sullivan, Shaun Charles E. Schmidt College of Science Department of Mathematical Sciences |
|
| Type of Resource: | text | |
| Genre: | Electronic Thesis Or Dissertation | |
| Date Issued: | 2011 | |
| Publisher: | Florida Atlantic University | |
| Physical Form: | electronic | |
| Extent: | vii, 91 p. : ill. | |
| Language(s): | English | |
| Summary: | 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. | |
| Identifier: | 746324324 (oclc), 3174076 (digitool), FADT3174076 (IID), fau:3673 (fedora) | |
| Note(s): |
by Shaun Sullivan. Thesis (Ph.D.)--Florida Atlantic University, 2011. Includes bibliography. Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web. |
|
| Subject(s): |
Combinatorial probabilities Lattice paths Combinatorial enumeration problems Generating functions |
|
| Persistent Link to This Record: | http://purl.flvc.org/FAU/3174076 | |
| Use and Reproduction: | http://rightsstatements.org/vocab/InC/1.0/ | |
| Host Institution: | FAU |
