A generating tree approach to k-nonnesting arc diagrams

Resource type
Thesis type
(Dissertation) Ph.D.
Date created
This thesis describes a strategy for exhaustively generating series information and enumerating combinatorial classes that can be represented using arc diagrams. We focus on k-nonnesting set partitions, permutations, matchings and tangled diagrams. Results are new functional equations, counting sequences, bijections and asymptotic results for these classes. Our key innovation is a generalized arc diagram in which arcs may have left endpoints, but not right endpoints, and our main tool is generating trees.
Copyright statement
Copyright is held by the author.
The author granted permission for the file to be printed and for the text to be copied and pasted.
Scholarly level
Supervisor or Senior Supervisor
Thesis advisor: Mishna, Marni
Thesis advisor: Yen, Lily
Member of collection
Attachment Size
etd8479_SBurrill.pdf 6.43 MB