| dc.contributor.author | McCombs, Kameron | |
| dc.date.accessioned | 2017-10-10T20:57:04Z | |
| dc.date.available | 2017-10-10T20:57:04Z | |
| dc.date.issued | 2017-05-03 | |
| dc.identifier | oksd_mccombs_HT_2017 | |
| dc.identifier.uri | https://hdl.handle.net/11244/52333 | |
| dc.description.abstract | The Catalan Numbers famously count many combinatorial sets including arc diagrams on 2n points and binary trees on n vertices. In this paper, I show that there is a bijection between extended leaf marked binary trees on n unmarked vertices and k marked vertices and "m" arc diagrams on 2n-k points by creating two functions that map between extended leaf marked binary trees and "m" arc diagrams. I then show that these functions are inverse bijections. | |
| 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 | "M" arc diagrams and their relationship to Borel's triangle | |
| osu.filename | oksd_mccombs_HT_2017.pdf | |
| osu.accesstype | Open Access | |
| dc.type.genre | Honors Thesis | |
| dc.type.material | Text | |
| dc.contributor.director | Mermin, Jeffrey A. | |
| dc.contributor.facultyreader | Schweig, Jay | |
| thesis.degree.discipline | Mathematics | |
| thesis.degree.grantor | Oklahoma State University | |
