dc.contributor.advisor | Mermin, Jeffrey | |
dc.contributor.author | Davis, William Anderson | |
dc.date.accessioned | 2020-01-30T19:46:34Z | |
dc.date.available | 2020-01-30T19:46:34Z | |
dc.date.issued | 2019-05 | |
dc.identifier.uri | https://hdl.handle.net/11244/323386 | |
dc.description.abstract | Borel's triangle is a triangular array of numbers constructed by a transformation of the Catalan numbers. By identifying natural bijections between them, we discuss several sets counted by Borel's triangle, including full binary trees with a fixed number of "marked" branching vertices, ballot sequences in elections between three parties, and permutations with a given set of properties. We further introduce a strategy which can be used to identify more combinatorial interpretations of Borel's triangle. | |
dc.format | application/pdf | |
dc.language | en_US | |
dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
dc.title | Transformation of the Catalan Numbers and Related Counted Sets | |
dc.contributor.committeeMember | Richmond, Edward | |
dc.contributor.committeeMember | Schweig, Jay | |
osu.filename | Davis_okstate_0664M_16189.pdf | |
osu.accesstype | Open Access | |
dc.type.genre | Thesis | |
dc.type.material | Text | |
thesis.degree.discipline | Mathematics | |
thesis.degree.grantor | Oklahoma State University | |