Browsing Combinatorics and Optimization by Subject "permutations"
Now showing items 1-2 of 2
-
Combinatorial Constructions for Transitive Factorizations in the Symmetric Group
(University of Waterloo, 2004)We consider the problem of counting <i>transitive factorizations</i> of permutations; that is, we study tuples (σ<i>r</i>,. . . ,σ1) of permutations on {1,. . . ,<i>n</i>} such that (1) the product ... -
Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus
(University of Waterloo, 2016-06-10)The problem of map enumeration is one that has been studied intensely for the past half century. Early work on this subject included the works of Tutte for various types of rooted planar maps and the works of Brown for ...