<?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-22T21:03:22Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1128" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1128</identifier><datestamp>2017-03-21T19:47:30Z</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="3343e8d6-856b-4374-b64f-bdfb62651940" confidence="600">Serrano, Luis</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:20:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:20:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1128</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800&amp;apos;s.   This problem translates combinatorially into factoring a permutation with a specified cycle type, with certain conditions on the cycle types of the factors, such as minimality and transitivity.      
Goulden and Jackson have given a proof for the number of minimal, transitive factorizations of a permutation into transpositions.   This proof involves a partial differential equation for the generating series, called the Join-Cut equation.   Furthermore, this argument is generalized to surfaces of higher genus.   Recently, Bousquet-M&amp;amp;eacute;lou and Schaeffer have found the number of minimal, transitive factorizations of a permutation into arbitrary unspecified factors.   This was proved by a purely combinatorial argument, based on a direct bijection between factorizations and certain objects called &amp;lt;em&amp;gt;m&amp;lt;/em&amp;gt;-Eulerian trees.      
In this thesis, we will give a new proof of the result by Bousquet-M&amp;amp;eacute;lou and Schaeffer, introducing a simple partial differential equation.   We apply algebraic methods based on Lagrange&amp;apos;s theorem, and combinatorial methods based on a new use of Bousquet-M&amp;amp;eacute;lou and Schaeffer&amp;apos;s &amp;lt;em&amp;gt;m&amp;lt;/em&amp;gt;-Eulerian trees.   Some partial results are also given for a refinement of this problem, in which the number of cycles in each factor is specified.   This involves Lagrange&amp;apos;s theorem in many variables.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1153003 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: 2005, 
  Serrano, Luis. 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">algebra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">enumeration</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">generating function</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">bijection</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">map</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ramified covers of the sphere</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">factorization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">permutation</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Transitive Factorizations of Permutations and Eulerian Maps in the Plane</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master 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">Master of Mathematics</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>