Dissertation/Thesis Abstract

Applications of the Goulden-Jackson cluster method to counting Dyck paths by occurrences of subwords
by Wang, Chao-Jen, Ph.D., Brandeis University, 2011, 68; 3474093
Abstract (Summary)

Goulden and Jackson introduced the cluster method for counting words avoiding a prescribed set of subwords in [14, 15]. Noonan and Zeilberger [17] generalized it and wrote many Maple programs to implement the method and its extensions. We count Dyck paths according to the number of occurrences of certain patterns, using a variation of the Goulden-Jackson cluster method. We will give several examples of counting Dyck paths by occurrences of subwords and show how to use the cluster method to compute generating functions for those examples. Then we show more applications to count paths with bounded height by occurrences of subwords and more applications to count r–Dyck paths.

Indexing (document details)
Advisor: Gessel, Ira
Commitee: Li, Ji, Parker, Susan
School: Brandeis University
Department: Mathematics
School Location: United States -- Massachusetts
Source: DAI-B 72/12, Dissertation Abstracts International
Source Type: DISSERTATION
Subjects: Applied Mathematics, Mathematics
Keywords: Cluster method, Combinatorics, Dyck path, Goulden-Jackson cluster, Occurrences of subwords
Publication Number: 3474093
ISBN: 9781124894669
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest