Generalized Catalan Numbers

Simple item page
dc.contributor.advisorBelaineh, Zelealem (PhD)
dc.contributor.authorAseressie, Eyerusalem
dc.date.accessioned2018-07-13T07:05:57Z
dc.date.accessioned2023-11-04T12:32:27Z
dc.date.available2018-07-13T07:05:57Z
dc.date.available2023-11-04T12:32:27Z
dc.date.issued2014-06
dc.description.abstractBallot problem was introduced in the late nineteen century to determine the probability of counting of votes when there are two candidates A and B such that A receives a votes, and B receives b votes with a > b. This project fo- cuses on the proof of Generalized Catalan numbers by using Ballot Theorem. We have introduced basic concepts and de_nitions in the _rst part. And in the second part, ballot problem is proved with three approaches such as proof by counting bad path, proof by induction and proof by cycle lemma. Then we used ballot theorem for the proof of generalized Catalan numbers formulaen_US
dc.identifier.urihttp://etd.aau.edu.et/handle/123456789/8455
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectGeneralized Catalan Numbersen_US
dc.titleGeneralized Catalan Numbersen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Eyerusalem Aseressie.pdf
Size:
303.02 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download

Collections

Mathematics