Show simple item record

dc.creatorStasiuk, Daniel W 1992-
dc.date.accessioned2019-02-04T20:00:03Z
dc.date.available2019-02-04T20:00:03Z
dc.date.created2019-06
dc.date.issued2019-02-04
dc.date.submittedJune 2019
dc.identifier.urihttp://hdl.handle.net/10388/11865
dc.description.abstractThis thesis solves an enumeration problem for sequences of complete n-ary trees. Given the sequence of all complete n-ary plane trees with a given number of internal nodes (weight), in lexicographical order, we perform graftings with the basic n-ary tree to construct sets of sequences of trees of higher weight. Determining the number of elements of these sets solves a problem originating from the theory of free nonsymmetric operads, as the sets of sequences of trees are equivalent to spanning sets of homogeneous subspaces of a principal operad ideal. Two different solutions will be presented: one using recurrence relations and properties of forests, the other using occupancy problems.
dc.format.mimetypeapplication/pdf
dc.subjectcombinatorics
dc.subjectoperad theory
dc.subjecttrees
dc.subjectplane trees
dc.subjectenumeration problems
dc.subjectdiscrete mathematics
dc.subjectforests
dc.subjectoccupancy problem
dc.titleAn Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads
dc.typeThesis
dc.date.updated2019-02-04T20:00:03Z
thesis.degree.departmentMathematics and Statistics
thesis.degree.disciplineMathematics
thesis.degree.grantorUniversity of Saskatchewan
thesis.degree.levelMasters
thesis.degree.nameMaster of Science (M.Sc.)
dc.type.materialtext
dc.contributor.committeeMemberKhan, Shahedul
dc.contributor.committeeMemberBickis, Mik G
dc.contributor.committeeMemberMcQuillan, Ian
dc.contributor.committeeMemberSoteros, Christine
dc.contributor.committeeMemberBremner, Murray R


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record