dc.creator Stasiuk, Daniel W 1992- dc.date.accessioned 2019-02-04T20:00:03Z dc.date.available 2019-02-04T20:00:03Z dc.date.created 2019-06 dc.date.issued 2019-02-04 dc.date.submitted June 2019 dc.identifier.uri http://hdl.handle.net/10388/11865 dc.description.abstract This 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.mimetype application/pdf dc.subject combinatorics dc.subject operad theory dc.subject trees dc.subject plane trees dc.subject enumeration problems dc.subject discrete mathematics dc.subject forests dc.subject occupancy problem dc.title An Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads dc.type Thesis dc.date.updated 2019-02-04T20:00:03Z thesis.degree.department Mathematics and Statistics thesis.degree.discipline Mathematics thesis.degree.grantor University of Saskatchewan thesis.degree.level Masters thesis.degree.name Master of Science (M.Sc.) dc.type.material text dc.contributor.committeeMember Khan, Shahedul dc.contributor.committeeMember Bickis, Mik G dc.contributor.committeeMember McQuillan, Ian dc.contributor.committeeMember Soteros, Christine dc.contributor.committeeMember Bremner, Murray R
﻿