Enumeration of binary strings and applications to compositions and partitions

Files
Raphadu_Enumeration_2023.pdf (4.09 MB)
Date
2023
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
University of the Witwatersrand, Johannesburg
Abstract
In this dissertation we first introduce binary strings and give a historical backĀ­ground. Then we discus some techniques for enumerating restricted sets of binary strings ,with several example . We employ mainly the symbolic method and recursive techniques, among others, to obtain our results. A chapter is devoted to a discusĀ­sion of some published case studies on bit string enumerations which are relevant to our project. Then we consider how the study of binary string may facilitate the enumeration of selected classes of compositions and integer partitions.
Description
A dissertation submitted to the School of Mathematics, Faculty of Science, in the fulfillment of the requirements for the degree of Masters of Science, University of the Witwatersrand, Johannesburg, 2023
Keywords
Binary strings, Geometry, Generating function of sequence, Fibonacci numbers
Citation
Raphadu, Maleka. (2024). Enumeration of binary strings and applications to compositions and partitions[Master's dissertation, University of the Witwatersrand, Johannesburg].https://hdl.handle.net/10539/38883
URI
https://hdl.handle.net/10539/38883
Collections
Electronic Theses and Dissertations (Masters)