<?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-22T15:35:01Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1028" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1028</identifier><datestamp>2017-03-21T20:04:55Z</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="762c47e2-07cc-4b6a-9a4b-f38343442e95" confidence="600">Rattan, Amarpreet</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:23:57Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:23:57Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2001</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2001</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1028</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The central topic of this thesis is parking functions.    We give a survey of some of the current literature concerning parking functions and focus on their interaction with other combinatorial objects; namely noncrossing partitions, hyperplane arrangements and tree inversions.    In the final chapter, we discuss generalizations of both parking functions and the above structures.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">609408 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: 2001, 
  Rattan, Amarpreet. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">parking function</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">noncrossing partition</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">hyperplane arrangement</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tree inversion</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Parking Functions and Related Combinatorial Structures.</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>