<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T02:14:54Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1102" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1102</identifier><datestamp>2017-03-21T21:38:45Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="18549a8a-8e60-485e-8765-1e6ce0367899" confidence="600">Irving, John</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:20:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:20:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2004</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2004</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1102</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We consider the problem of counting &amp;lt;i&amp;gt;transitive factorizations&amp;lt;/i&amp;gt; of  permutations; that is, we study tuples (&amp;amp;sigma;&amp;lt;i&amp;gt;r&amp;lt;/i&amp;gt;,.  .  .  ,&amp;amp;sigma;1) of permutations on  {1,.  .  .  ,&amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt;} such that (1) the product &amp;amp;sigma;&amp;lt;i&amp;gt;r&amp;lt;/i&amp;gt;.  .  .  &amp;amp;sigma;1 is equal to a given  target permutation &amp;amp;pi;, and (2) the group generated by the factors &amp;amp;sigma;&amp;lt;i&amp;gt;i&amp;lt;/i&amp;gt; acts  transitively on {1,.  .  .  ,&amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt;}.   This problem is widely known as the &amp;lt;i&amp;gt;Hurwitz  Enumeration Problem&amp;lt;/i&amp;gt;, since an encoding due to Hurwitz shows it to be equivalent to  the enumeration of connected branched coverings of the sphere by a surface of given  genus with specified branching.       Much of our work concerns the enumeration of transitive factorizations of  permutations into a minimal number of transposition factors.   This problem has  received considerable attention, and a formula for the number &amp;lt;i&amp;gt;c&amp;lt;/i&amp;gt;(&amp;amp;pi;) of such  factorizations of an arbitrary permutation &amp;amp;pi; has been derived through various  means.   The formula is remarkably simple, being a product of well-known combinatorial  numbers, but no bijective proof of it is known except in the special case where &amp;amp;pi;  is a full cycle.   A major goal of this thesis is to provide further combinatorial  rationale for this formula.       We begin by introducing an encoding of factorizations (into transpositions) as  edge-labelled maps.   Our central result is a bijection that allows trees to be  &amp;quot;pruned&amp;quot; from such maps.   This is shown to explain the appearance of factors of the  form &amp;lt;i&amp;gt;k^k&amp;lt;/i&amp;gt; in the aforementioned formula for &amp;lt;i&amp;gt;c&amp;lt;/i&amp;gt;(&amp;amp;pi;).    It also has the effect of  shifting focus to the combinatorics of smooth maps (&amp;lt;i&amp;gt;i.  e.  &amp;lt;/i&amp;gt; maps without  vertices of degree one).   By providing decompositions for certain smooth planar maps,  we are able to give combinatorial evaluations of &amp;lt;i&amp;gt;c&amp;lt;/i&amp;gt;(&amp;amp;pi;) when &amp;amp;pi; is composed of up  to three cycles.       Many of these results are generalized to factorizations in which the factors are  cycles of any length.    We also investigate the &amp;lt;i&amp;gt;Double Hurwitz Problem&amp;lt;/i&amp;gt;, which  calls for the enumeration of factorizations whose leftmost factor is of specified  cycle type, and whose remaining factors are transpositions.   Finally, we extend our  methods to the enumeration of factorizations up to an equivalence relation induced  by possible commutations between adjacent factors.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1639162 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2004, 
  Irving, John. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">combinatorics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">factorizations</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">permutations</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">symmetric group</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Combinatorial Constructions for Transitive Factorizations in the Symmetric Group</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>