Enumerative properties of restricted words and compositions

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.


MacFie, Andrew




In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count cyclically restricted and circular objects. This either fills gaps in the current literature by e.g. considering particular new patterns, or involves general progress, notably with locally restricted compositions over a finite group. We associate these compositions to walks on a covering graph whose structure is exploited to simplify asymptotic expressions. Specifically, we show that under certain conditions the number of locally restricted compositions of a group element is asymptotically independent of the group element. For some problems our results extend to the case of a positive number of subword pattern occurrences (instead of zero for pattern avoidance) or convergence in distribution of the normalized number of occurrences. We typically apply the more general propositions to concrete examples such as the familiar Carlitz compositions or simple subword patterns.






Carleton University

Thesis Degree Name: 

Doctor of Philosophy: 

Thesis Degree Level: 


Thesis Degree Discipline: 

Applied Mathematics

Parent Collection: 

Theses and Dissertations

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).